./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro --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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- 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-8393723 [2022-11-18 20:19:28,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:19:28,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:19:28,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:19:28,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:19:28,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:19:28,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:19:28,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:19:28,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:19:28,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:19:28,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:19:28,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:19:28,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:19:28,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:19:28,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:19:28,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:19:28,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:19:28,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:19:28,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:19:28,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:19:28,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:19:28,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:19:28,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:19:28,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:19:28,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:19:28,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:19:28,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:19:28,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:19:28,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:19:28,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:19:28,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:19:28,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:19:28,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:19:28,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:19:28,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:19:28,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:19:28,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:19:28,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:19:28,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:19:28,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:19:28,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:19:28,808 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:19:28,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:19:28,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:19:28,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:19:28,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:19:28,850 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:19:28,850 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:19:28,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:19:28,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:19:28,851 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:19:28,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:19:28,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:19:28,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:19:28,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:19:28,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:19:28,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:19:28,854 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:19:28,854 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:19:28,854 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:19:28,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:19:28,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:19:28,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:19:28,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:19:28,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:19:28,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:19:28,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:19:28,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:19:28,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:19:28,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:19:28,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:19:28,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:19:28,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/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_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro 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 -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2022-11-18 20:19:29,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:19:29,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:19:29,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:19:29,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:19:29,228 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:19:29,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-11-18 20:19:29,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/564840cd2/a8a5274c604a49d1ac1fef2610564f6a/FLAGdc9f0a997 [2022-11-18 20:19:29,975 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:19:29,976 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-11-18 20:19:29,991 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/564840cd2/a8a5274c604a49d1ac1fef2610564f6a/FLAGdc9f0a997 [2022-11-18 20:19:30,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/564840cd2/a8a5274c604a49d1ac1fef2610564f6a [2022-11-18 20:19:30,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:19:30,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:19:30,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:19:30,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:19:30,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:19:30,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:19:30" (1/1) ... [2022-11-18 20:19:30,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290f5d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:30, skipping insertion in model container [2022-11-18 20:19:30,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:19:30" (1/1) ... [2022-11-18 20:19:30,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:19:30,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:19:30,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:19:30,767 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-18 20:19:30,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@583a970b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:30, skipping insertion in model container [2022-11-18 20:19:30,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:19:30,769 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-18 20:19:30,771 INFO L158 Benchmark]: Toolchain (without parser) took 531.60ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 71.3MB in the end (delta: -13.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-11-18 20:19:30,771 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:19:30,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.25ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 71.7MB in the end (delta: -13.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-11-18 20:19:30,774 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.26ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.25ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 71.7MB in the end (delta: -13.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro --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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- 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-8393723 [2022-11-18 20:19:32,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:19:32,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:19:32,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:19:32,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:19:32,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:19:32,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:19:32,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:19:32,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:19:32,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:19:32,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:19:32,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:19:32,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:19:32,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:19:32,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:19:32,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:19:32,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:19:32,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:19:32,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:19:32,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:19:32,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:19:32,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:19:32,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:19:32,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:19:32,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:19:32,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:19:32,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:19:32,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:19:32,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:19:32,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:19:32,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:19:32,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:19:32,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:19:32,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:19:32,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:19:32,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:19:32,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:19:32,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:19:32,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:19:32,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:19:32,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:19:32,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 20:19:32,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:19:32,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:19:32,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:19:32,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:19:32,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:19:32,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:19:32,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:19:32,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:19:32,917 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:19:32,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:19:32,918 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:19:32,918 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:19:32,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:19:32,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:19:32,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:19:32,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:19:32,919 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:19:32,920 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:19:32,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:19:32,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:19:32,920 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:19:32,920 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:19:32,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:19:32,921 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:19:32,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:19:32,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:19:32,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:19:32,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:19:32,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:19:32,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:19:32,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:19:32,923 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:19:32,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:19:32,924 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/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_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro 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 -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2022-11-18 20:19:33,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:19:33,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:19:33,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:19:33,382 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:19:33,383 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:19:33,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-11-18 20:19:33,456 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/375ae6fb4/21a8416dca844429ac13601f87b76d75/FLAGc67850af5 [2022-11-18 20:19:34,086 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:19:34,086 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-11-18 20:19:34,099 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/375ae6fb4/21a8416dca844429ac13601f87b76d75/FLAGc67850af5 [2022-11-18 20:19:34,338 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/data/375ae6fb4/21a8416dca844429ac13601f87b76d75 [2022-11-18 20:19:34,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:19:34,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:19:34,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:19:34,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:19:34,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:19:34,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:19:34" (1/1) ... [2022-11-18 20:19:34,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6b808d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:34, skipping insertion in model container [2022-11-18 20:19:34,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:19:34" (1/1) ... [2022-11-18 20:19:34,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:19:34,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:19:34,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:19:34,815 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:19:34,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:19:34,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:19:34,884 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:19:34,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:19:35,034 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:19:35,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35 WrapperNode [2022-11-18 20:19:35,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:19:35,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:19:35,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:19:35,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:19:35,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,087 INFO L138 Inliner]: procedures = 166, calls = 76, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 70 [2022-11-18 20:19:35,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:19:35,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:19:35,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:19:35,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:19:35,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:19:35,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:19:35,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:19:35,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:19:35,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (1/1) ... [2022-11-18 20:19:35,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:19:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:19:35,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:19:35,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:19:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:19:35,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:19:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:19:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:19:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:19:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:19:35,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:19:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:19:35,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:19:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:19:35,412 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:19:35,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:19:35,765 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:19:35,772 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:19:35,772 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 20:19:35,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:19:35 BoogieIcfgContainer [2022-11-18 20:19:35,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:19:35,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:19:35,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:19:35,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:19:35,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:19:34" (1/3) ... [2022-11-18 20:19:35,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b2151b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:19:35, skipping insertion in model container [2022-11-18 20:19:35,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:19:35" (2/3) ... [2022-11-18 20:19:35,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b2151b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:19:35, skipping insertion in model container [2022-11-18 20:19:35,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:19:35" (3/3) ... [2022-11-18 20:19:35,783 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3.i [2022-11-18 20:19:35,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:19:35,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-18 20:19:35,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:19:35,864 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64f9961d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:19:35,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-18 20:19:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 48 states have internal predecessors, (57), 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-18 20:19:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:19:35,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:35,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:35,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:35,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 714233942, now seen corresponding path program 1 times [2022-11-18 20:19:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:35,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878277103] [2022-11-18 20:19:35,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:35,896 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-18 20:19:35,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:35,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:35,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:36,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:19:36,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:36,151 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-18 20:19:36,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:19:36,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:36,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878277103] [2022-11-18 20:19:36,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878277103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:19:36,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:19:36,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:19:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979109721] [2022-11-18 20:19:36,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:19:36,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:19:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:19:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:19:36,211 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 48 states have internal predecessors, (57), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:36,378 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-11-18 20:19:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:19:36,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-18 20:19:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:36,394 INFO L225 Difference]: With dead ends: 98 [2022-11-18 20:19:36,394 INFO L226 Difference]: Without dead ends: 94 [2022-11-18 20:19:36,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:19:36,405 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:36,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 199 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:19:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-18 20:19:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-11-18 20:19:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:19:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-11-18 20:19:36,461 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 11 [2022-11-18 20:19:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:36,462 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-11-18 20:19:36,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-11-18 20:19:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:19:36,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:36,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:36,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:36,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:36,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash 714155687, now seen corresponding path program 1 times [2022-11-18 20:19:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:36,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141964053] [2022-11-18 20:19:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:36,685 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-18 20:19:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:36,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:36,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:36,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:19:36,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:36,824 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-18 20:19:36,890 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-18 20:19:36,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:19:36,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:36,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141964053] [2022-11-18 20:19:36,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141964053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:19:36,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:19:36,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:19:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862398305] [2022-11-18 20:19:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:19:36,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:19:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:19:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:19:36,894 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:37,076 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-11-18 20:19:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:19:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-18 20:19:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:37,078 INFO L225 Difference]: With dead ends: 67 [2022-11-18 20:19:37,078 INFO L226 Difference]: Without dead ends: 67 [2022-11-18 20:19:37,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:19:37,079 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:37,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:19:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-18 20:19:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-11-18 20:19:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:19:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-11-18 20:19:37,087 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 11 [2022-11-18 20:19:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:37,088 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-11-18 20:19:37,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-11-18 20:19:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:19:37,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:37,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:37,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:37,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:37,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 714155688, now seen corresponding path program 1 times [2022-11-18 20:19:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:37,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434687944] [2022-11-18 20:19:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:37,302 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-18 20:19:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:37,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:37,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:37,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:19:37,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:37,394 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-18 20:19:37,533 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-18 20:19:37,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:19:37,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:37,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434687944] [2022-11-18 20:19:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434687944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:19:37,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:19:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:19:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465914098] [2022-11-18 20:19:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:19:37,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:19:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:37,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:19:37,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:19:37,538 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:37,896 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-18 20:19:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:19:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-18 20:19:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:37,898 INFO L225 Difference]: With dead ends: 82 [2022-11-18 20:19:37,898 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 20:19:37,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:19:37,899 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 76 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:37,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 223 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:19:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 20:19:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-11-18 20:19:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:19:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-11-18 20:19:37,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 11 [2022-11-18 20:19:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:37,911 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-11-18 20:19:37,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-11-18 20:19:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:19:37,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:37,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:37,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1601737623, now seen corresponding path program 1 times [2022-11-18 20:19:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:38,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41949762] [2022-11-18 20:19:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:38,120 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-18 20:19:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:38,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:38,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:19:38,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:38,200 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-18 20:19:38,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:19:38,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41949762] [2022-11-18 20:19:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41949762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:19:38,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:19:38,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:19:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145262083] [2022-11-18 20:19:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:19:38,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:19:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:19:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:19:38,203 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:38,315 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2022-11-18 20:19:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:19:38,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-18 20:19:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:38,317 INFO L225 Difference]: With dead ends: 106 [2022-11-18 20:19:38,318 INFO L226 Difference]: Without dead ends: 104 [2022-11-18 20:19:38,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:19:38,319 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:38,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:19:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-18 20:19:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2022-11-18 20:19:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:19:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-11-18 20:19:38,327 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 11 [2022-11-18 20:19:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:38,327 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-11-18 20:19:38,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-11-18 20:19:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:19:38,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:38,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:38,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:19:38,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1601659368, now seen corresponding path program 1 times [2022-11-18 20:19:38,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:38,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583337872] [2022-11-18 20:19:38,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:38,550 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-18 20:19:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:38,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:38,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:19:38,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:38,653 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-18 20:19:38,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:19:38,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583337872] [2022-11-18 20:19:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583337872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:19:38,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:19:38,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:19:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788819609] [2022-11-18 20:19:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:19:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:19:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:19:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:19:38,657 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:38,702 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-11-18 20:19:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:19:38,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-18 20:19:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:38,704 INFO L225 Difference]: With dead ends: 61 [2022-11-18 20:19:38,704 INFO L226 Difference]: Without dead ends: 59 [2022-11-18 20:19:38,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:19:38,705 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:38,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:19:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-18 20:19:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-18 20:19:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:19:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-18 20:19:38,711 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 11 [2022-11-18 20:19:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:38,712 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-18 20:19:38,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-18 20:19:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:19:38,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:38,713 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:38,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:38,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1855917097, now seen corresponding path program 1 times [2022-11-18 20:19:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:38,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561167617] [2022-11-18 20:19:38,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:38,935 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-18 20:19:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:38,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:38,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:39,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:19:39,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:39,042 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-18 20:19:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:39,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:40,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:40,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561167617] [2022-11-18 20:19:40,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561167617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:19:40,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:19:40,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-18 20:19:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948329243] [2022-11-18 20:19:40,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:40,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:19:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:19:40,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:19:40,101 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 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-18 20:19:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:41,158 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-11-18 20:19:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:19:41,160 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-11-18 20:19:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:41,161 INFO L225 Difference]: With dead ends: 97 [2022-11-18 20:19:41,161 INFO L226 Difference]: Without dead ends: 97 [2022-11-18 20:19:41,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:19:41,162 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 240 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:41,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 261 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 81 Unchecked, 0.7s Time] [2022-11-18 20:19:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-18 20:19:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2022-11-18 20:19:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:19:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-18 20:19:41,169 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 14 [2022-11-18 20:19:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:41,170 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-18 20:19:41,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 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-18 20:19:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-18 20:19:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:19:41,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:41,171 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:41,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 20:19:41,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:41,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:41,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:41,383 INFO L85 PathProgramCache]: Analyzing trace with hash 854181427, now seen corresponding path program 1 times [2022-11-18 20:19:41,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920270300] [2022-11-18 20:19:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:41,384 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-18 20:19:41,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:41,385 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:41,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:41,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:19:41,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:41,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:41,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:41,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920270300] [2022-11-18 20:19:41,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920270300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:19:41,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:19:41,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-18 20:19:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358924849] [2022-11-18 20:19:41,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:41,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:19:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:19:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:19:41,676 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-18 20:19:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:41,892 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-18 20:19:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:19:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) Word has length 22 [2022-11-18 20:19:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:41,894 INFO L225 Difference]: With dead ends: 74 [2022-11-18 20:19:41,894 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 20:19:41,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:19:41,895 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:41,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 232 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:19:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 20:19:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-11-18 20:19:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:19:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-18 20:19:41,900 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 22 [2022-11-18 20:19:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:41,900 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-18 20:19:41,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-18 20:19:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-18 20:19:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:19:41,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:41,901 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:41,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:42,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:42,113 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1071704552, now seen corresponding path program 2 times [2022-11-18 20:19:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:42,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48777926] [2022-11-18 20:19:42,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:19:42,114 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-18 20:19:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:42,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:42,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:42,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:19:42,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:19:42,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:19:42,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:42,248 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-18 20:19:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:42,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:44,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:44,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48777926] [2022-11-18 20:19:44,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48777926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:19:44,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:19:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-11-18 20:19:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382138510] [2022-11-18 20:19:44,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 20:19:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 20:19:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-11-18 20:19:44,729 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 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-18 20:19:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:48,729 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-11-18 20:19:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:19:48,730 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-18 20:19:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:48,730 INFO L225 Difference]: With dead ends: 91 [2022-11-18 20:19:48,731 INFO L226 Difference]: Without dead ends: 91 [2022-11-18 20:19:48,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-11-18 20:19:48,732 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 355 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:48,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 393 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 374 Invalid, 0 Unknown, 85 Unchecked, 1.4s Time] [2022-11-18 20:19:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-18 20:19:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-11-18 20:19:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:19:48,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2022-11-18 20:19:48,739 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 23 [2022-11-18 20:19:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:48,739 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2022-11-18 20:19:48,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 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-18 20:19:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2022-11-18 20:19:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:19:48,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:48,740 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:48,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:48,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:48,941 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1134263027, now seen corresponding path program 2 times [2022-11-18 20:19:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663272975] [2022-11-18 20:19:48,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:19:48,942 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-18 20:19:48,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:48,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:48,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:49,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:19:49,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:19:49,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:19:49,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-18 20:19:49,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:19:49,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663272975] [2022-11-18 20:19:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663272975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:19:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:19:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:19:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718317572] [2022-11-18 20:19:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:19:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:19:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:19:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:19:49,104 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:49,161 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-11-18 20:19:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:19:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-11-18 20:19:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:49,164 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:19:49,164 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 20:19:49,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-18 20:19:49,165 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 105 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:49,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:19:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 20:19:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2022-11-18 20:19:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:19:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-11-18 20:19:49,169 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 34 [2022-11-18 20:19:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:49,170 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-11-18 20:19:49,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:19:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-11-18 20:19:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 20:19:49,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:49,171 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:49,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:49,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 269265368, now seen corresponding path program 1 times [2022-11-18 20:19:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295003711] [2022-11-18 20:19:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:19:49,382 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-18 20:19:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:49,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:49,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:19:49,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:19:49,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:49,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:19:50,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:50,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295003711] [2022-11-18 20:19:50,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295003711] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:19:50,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:19:50,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-18 20:19:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612361024] [2022-11-18 20:19:50,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:50,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:19:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:19:50,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:19:50,136 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 20:19:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:19:50,610 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-18 20:19:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:19:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-11-18 20:19:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:19:50,613 INFO L225 Difference]: With dead ends: 81 [2022-11-18 20:19:50,614 INFO L226 Difference]: Without dead ends: 81 [2022-11-18 20:19:50,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:19:50,615 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 94 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:19:50,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 361 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:19:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-18 20:19:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-18 20:19:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:19:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-18 20:19:50,629 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 38 [2022-11-18 20:19:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:19:50,631 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-18 20:19:50,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 20:19:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-18 20:19:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:19:50,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:19:50,635 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:19:50,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:50,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:50,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:19:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:19:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1255484104, now seen corresponding path program 3 times [2022-11-18 20:19:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:19:50,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645116280] [2022-11-18 20:19:50,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:19:50,837 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-18 20:19:50,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:19:50,838 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:50,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:19:51,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-18 20:19:51,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:19:51,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:19:51,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:19:51,117 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-18 20:19:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:51,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:19:56,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:19:56,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645116280] [2022-11-18 20:19:56,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645116280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:19:56,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:19:56,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2022-11-18 20:19:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021465217] [2022-11-18 20:19:56,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:56,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-18 20:19:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:19:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-18 20:19:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2022-11-18 20:19:56,071 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 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-18 20:20:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:00,060 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-11-18 20:20:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:20:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-18 20:20:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:00,062 INFO L225 Difference]: With dead ends: 115 [2022-11-18 20:20:00,062 INFO L226 Difference]: Without dead ends: 115 [2022-11-18 20:20:00,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=301, Invalid=1031, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:20:00,063 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 721 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:00,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 614 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 852 Invalid, 0 Unknown, 109 Unchecked, 2.7s Time] [2022-11-18 20:20:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-18 20:20:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2022-11-18 20:20:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-11-18 20:20:00,068 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 41 [2022-11-18 20:20:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:00,069 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-11-18 20:20:00,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 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-18 20:20:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-11-18 20:20:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:20:00,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:00,071 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:00,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:00,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1908613480, now seen corresponding path program 2 times [2022-11-18 20:20:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975380117] [2022-11-18 20:20:00,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:20:00,286 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-18 20:20:00,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:00,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:00,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:00,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:20:00,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:20:00,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:20:00,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:00,507 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-18 20:20:00,516 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-18 20:20:00,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_269 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_269))))) is different from true [2022-11-18 20:20:01,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:01,024 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-18 20:20:01,039 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:01,039 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-18 20:20:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2022-11-18 20:20:01,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:09,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975380117] [2022-11-18 20:20:09,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975380117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1260028132] [2022-11-18 20:20:09,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:20:09,552 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:20:09,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:20:09,558 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:20:09,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-18 20:20:09,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:20:09,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:20:09,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:20:09,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:09,982 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-18 20:20:09,989 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-18 20:20:10,356 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_339 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_339) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:20:10,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:10,384 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-18 20:20:10,399 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:10,399 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-18 20:20:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2022-11-18 20:20:10,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:12,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1260028132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:12,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:12,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2022-11-18 20:20:12,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770884568] [2022-11-18 20:20:12,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:12,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:20:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:20:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=5, NotChecked=42, Total=182 [2022-11-18 20:20:12,690 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:13,462 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-11-18 20:20:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:20:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-18 20:20:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:13,464 INFO L225 Difference]: With dead ends: 168 [2022-11-18 20:20:13,464 INFO L226 Difference]: Without dead ends: 168 [2022-11-18 20:20:13,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=44, Invalid=169, Unknown=5, NotChecked=54, Total=272 [2022-11-18 20:20:13,465 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:13,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 394 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 224 Unchecked, 0.6s Time] [2022-11-18 20:20:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-18 20:20:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 112. [2022-11-18 20:20:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 105 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:20:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2022-11-18 20:20:13,471 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 50 [2022-11-18 20:20:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:13,472 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2022-11-18 20:20:13,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2022-11-18 20:20:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:20:13,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:13,473 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:13,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:13,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:13,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:13,878 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1908613481, now seen corresponding path program 1 times [2022-11-18 20:20:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:13,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787469275] [2022-11-18 20:20:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:13,879 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-18 20:20:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:13,881 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:13,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:14,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:20:14,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:14,084 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-18 20:20:14,228 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2022-11-18 20:20:14,248 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:20:14,248 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-18 20:20:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2022-11-18 20:20:14,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-18 20:20:14,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:14,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787469275] [2022-11-18 20:20:14,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787469275] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:14,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:14,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-11-18 20:20:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152694407] [2022-11-18 20:20:14,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:14,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:20:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:20:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2022-11-18 20:20:14,508 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:14,779 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2022-11-18 20:20:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:20:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-18 20:20:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:14,781 INFO L225 Difference]: With dead ends: 130 [2022-11-18 20:20:14,781 INFO L226 Difference]: Without dead ends: 128 [2022-11-18 20:20:14,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2022-11-18 20:20:14,782 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 52 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:14,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 242 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2022-11-18 20:20:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-18 20:20:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2022-11-18 20:20:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.25) internal successors, (105), 94 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:20:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-11-18 20:20:14,790 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 50 [2022-11-18 20:20:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:14,790 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-11-18 20:20:14,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-11-18 20:20:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:20:14,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:14,792 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:14,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:15,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -226568731, now seen corresponding path program 1 times [2022-11-18 20:20:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:15,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488649839] [2022-11-18 20:20:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:15,004 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-18 20:20:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:15,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:15,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:20:15,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:15,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:20:15,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:15,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488649839] [2022-11-18 20:20:15,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488649839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:15,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:15,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:20:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911879576] [2022-11-18 20:20:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:15,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:20:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:20:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:20:15,227 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:20:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:15,280 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2022-11-18 20:20:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:20:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-18 20:20:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:15,282 INFO L225 Difference]: With dead ends: 122 [2022-11-18 20:20:15,282 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:20:15,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:20:15,283 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:15,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:20:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:20:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2022-11-18 20:20:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 95 states have internal predecessors, (106), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:20:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-11-18 20:20:15,294 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 52 [2022-11-18 20:20:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:15,295 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-11-18 20:20:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:20:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-11-18 20:20:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:20:15,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:15,300 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:15,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:15,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,501 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1516241604, now seen corresponding path program 1 times [2022-11-18 20:20:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:15,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226132801] [2022-11-18 20:20:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:15,502 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-18 20:20:15,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:15,503 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-18 20:20:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:15,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:20:15,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-18 20:20:15,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:20:15,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226132801] [2022-11-18 20:20:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226132801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:15,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:20:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045796937] [2022-11-18 20:20:15,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:15,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:20:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:20:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:20:15,684 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-18 20:20:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:15,762 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-11-18 20:20:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:20:15,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) Word has length 52 [2022-11-18 20:20:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:15,763 INFO L225 Difference]: With dead ends: 117 [2022-11-18 20:20:15,764 INFO L226 Difference]: Without dead ends: 117 [2022-11-18 20:20:15,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-18 20:20:15,765 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 21 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:15,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 131 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:20:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-18 20:20:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2022-11-18 20:20:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 97 states have internal predecessors, (108), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:20:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-18 20:20:15,770 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 52 [2022-11-18 20:20:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:15,770 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-18 20:20:15,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-18 20:20:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-18 20:20:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:20:15,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:15,772 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:15,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:15,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -840525585, now seen corresponding path program 1 times [2022-11-18 20:20:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:15,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055283148] [2022-11-18 20:20:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:15,985 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-18 20:20:15,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:15,986 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:15,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-18 20:20:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:16,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:20:16,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-18 20:20:16,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-18 20:20:16,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055283148] [2022-11-18 20:20:16,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055283148] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:16,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:16,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-18 20:20:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372587146] [2022-11-18 20:20:16,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:16,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:20:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:20:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:20:16,461 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:20:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:16,673 INFO L93 Difference]: Finished difference Result 227 states and 257 transitions. [2022-11-18 20:20:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:20:16,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2022-11-18 20:20:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:16,675 INFO L225 Difference]: With dead ends: 227 [2022-11-18 20:20:16,675 INFO L226 Difference]: Without dead ends: 227 [2022-11-18 20:20:16,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:20:16,676 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 293 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:16,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 200 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:20:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-18 20:20:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 138. [2022-11-18 20:20:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 123 states have internal predecessors, (144), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-18 20:20:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2022-11-18 20:20:16,683 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 55 [2022-11-18 20:20:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:16,684 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2022-11-18 20:20:16,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:20:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2022-11-18 20:20:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:20:16,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:16,685 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:16,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:16,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:16,886 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash 181256032, now seen corresponding path program 1 times [2022-11-18 20:20:16,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:16,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033597234] [2022-11-18 20:20:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:16,887 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-18 20:20:16,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:16,887 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:16,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-18 20:20:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:17,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:20:17,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-18 20:20:17,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:17,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:17,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033597234] [2022-11-18 20:20:17,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033597234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:17,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:17,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-11-18 20:20:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748881999] [2022-11-18 20:20:17,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:17,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:20:17,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:17,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:20:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:20:17,666 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:20:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:17,778 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2022-11-18 20:20:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:20:17,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2022-11-18 20:20:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:17,781 INFO L225 Difference]: With dead ends: 137 [2022-11-18 20:20:17,781 INFO L226 Difference]: Without dead ends: 137 [2022-11-18 20:20:17,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:20:17,782 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 134 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:17,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 151 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 9 Unchecked, 0.1s Time] [2022-11-18 20:20:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-18 20:20:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-18 20:20:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 122 states have internal predecessors, (142), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-18 20:20:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2022-11-18 20:20:17,788 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 55 [2022-11-18 20:20:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:17,788 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2022-11-18 20:20:17,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:20:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-11-18 20:20:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:20:17,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:17,790 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:17,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-18 20:20:18,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:18,002 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:18,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1024677531, now seen corresponding path program 1 times [2022-11-18 20:20:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:18,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707453423] [2022-11-18 20:20:18,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:18,004 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-18 20:20:18,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:18,005 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:18,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-18 20:20:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:18,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:20:18,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:18,603 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)))) is different from true [2022-11-18 20:20:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:18,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:18,819 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret42#1.base_41| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret42#1.base_41|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret42#1.base_41| (_ bv0 1))))) is different from false [2022-11-18 20:20:18,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:18,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707453423] [2022-11-18 20:20:18,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707453423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:18,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345986173] [2022-11-18 20:20:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:18,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:20:18,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:20:18,822 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:20:18,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-18 20:20:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:19,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:20:19,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:19,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:19,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret42#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret42#1.base_44|) (_ bv0 1))) (= (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret42#1.base_44| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-18 20:20:19,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1345986173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:19,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:19,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-11-18 20:20:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193696983] [2022-11-18 20:20:19,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:19,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:20:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:20:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2022-11-18 20:20:19,900 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 12 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:20:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:20,043 INFO L93 Difference]: Finished difference Result 148 states and 174 transitions. [2022-11-18 20:20:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:20:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2022-11-18 20:20:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:20,044 INFO L225 Difference]: With dead ends: 148 [2022-11-18 20:20:20,045 INFO L226 Difference]: Without dead ends: 138 [2022-11-18 20:20:20,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=172, Unknown=3, NotChecked=84, Total=306 [2022-11-18 20:20:20,046 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:20,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 405 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 153 Unchecked, 0.1s Time] [2022-11-18 20:20:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-18 20:20:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2022-11-18 20:20:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.203883495145631) internal successors, (124), 110 states have internal predecessors, (124), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-18 20:20:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2022-11-18 20:20:20,051 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 58 [2022-11-18 20:20:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:20,052 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2022-11-18 20:20:20,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:20:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2022-11-18 20:20:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 20:20:20,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:20,053 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:20,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-11-18 20:20:20,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:20,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:20:20,466 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1043028556, now seen corresponding path program 1 times [2022-11-18 20:20:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:20,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192583700] [2022-11-18 20:20:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:20,467 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-18 20:20:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:20,469 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:20,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-18 20:20:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:20,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:20:20,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:20,714 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-18 20:20:20,720 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-18 20:20:21,154 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_879 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_879) |c_#length|)))) is different from true [2022-11-18 20:20:21,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:21,176 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-18 20:20:21,187 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:21,187 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-18 20:20:21,322 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_880 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_880) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:20:21,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:21,344 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-18 20:20:21,359 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:21,364 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-18 20:20:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 6 not checked. [2022-11-18 20:20:21,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:25,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:25,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192583700] [2022-11-18 20:20:25,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192583700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:25,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [240646809] [2022-11-18 20:20:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:20:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:20:25,876 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:20:25,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-18 20:20:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:26,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:20:26,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:26,386 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-18 20:20:26,395 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-18 20:20:26,753 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_958 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_958) |c_#length|)))) is different from true [2022-11-18 20:20:26,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:26,775 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-18 20:20:26,791 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:26,791 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-18 20:20:26,873 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_959 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_959) |c_#length|)))) is different from true [2022-11-18 20:20:26,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:26,895 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-18 20:20:26,912 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:26,912 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-18 20:20:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 6 not checked. [2022-11-18 20:20:26,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:27,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [240646809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:27,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:27,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2022-11-18 20:20:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259197823] [2022-11-18 20:20:27,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:27,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:20:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:20:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=152, Unknown=5, NotChecked=108, Total=306 [2022-11-18 20:20:27,248 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 20:20:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:28,140 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2022-11-18 20:20:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:20:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2022-11-18 20:20:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:28,141 INFO L225 Difference]: With dead ends: 168 [2022-11-18 20:20:28,142 INFO L226 Difference]: Without dead ends: 168 [2022-11-18 20:20:28,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=63, Invalid=254, Unknown=5, NotChecked=140, Total=462 [2022-11-18 20:20:28,143 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:28,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 373 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 0 Unknown, 288 Unchecked, 0.7s Time] [2022-11-18 20:20:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-18 20:20:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 124. [2022-11-18 20:20:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 110 states have internal predecessors, (122), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-18 20:20:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-11-18 20:20:28,149 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 60 [2022-11-18 20:20:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:28,149 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-11-18 20:20:28,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 20:20:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-11-18 20:20:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-18 20:20:28,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:28,151 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:28,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-18 20:20:28,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:28,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:20:28,559 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -929144456, now seen corresponding path program 1 times [2022-11-18 20:20:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:28,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168490909] [2022-11-18 20:20:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:28,560 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-18 20:20:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:28,560 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:28,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-18 20:20:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:28,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:20:28,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:29,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:29,709 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 9 [2022-11-18 20:20:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:30,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168490909] [2022-11-18 20:20:30,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168490909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:30,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:30,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-11-18 20:20:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797712394] [2022-11-18 20:20:30,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:30,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:20:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:20:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:20:30,208 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:32,709 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2022-11-18 20:20:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:20:32,711 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2022-11-18 20:20:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:32,712 INFO L225 Difference]: With dead ends: 223 [2022-11-18 20:20:32,712 INFO L226 Difference]: Without dead ends: 223 [2022-11-18 20:20:32,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2022-11-18 20:20:32,713 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 275 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:32,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 459 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 319 Invalid, 0 Unknown, 55 Unchecked, 1.2s Time] [2022-11-18 20:20:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-18 20:20:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 124. [2022-11-18 20:20:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 110 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-18 20:20:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-11-18 20:20:32,720 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 62 [2022-11-18 20:20:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:32,721 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-11-18 20:20:32,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-11-18 20:20:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 20:20:32,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:32,722 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:32,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:32,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:32,935 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:32,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1261292942, now seen corresponding path program 1 times [2022-11-18 20:20:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:32,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160429206] [2022-11-18 20:20:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:32,935 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-18 20:20:32,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:32,936 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:32,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-18 20:20:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:33,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:20:33,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:33,385 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 15 treesize of output 11 [2022-11-18 20:20:33,597 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-18 20:20:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-18 20:20:33,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-18 20:20:33,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160429206] [2022-11-18 20:20:33,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160429206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:33,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:33,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2022-11-18 20:20:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86728912] [2022-11-18 20:20:33,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:20:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:33,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:20:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:20:33,893 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:20:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:35,341 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2022-11-18 20:20:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:20:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-11-18 20:20:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:35,344 INFO L225 Difference]: With dead ends: 179 [2022-11-18 20:20:35,344 INFO L226 Difference]: Without dead ends: 179 [2022-11-18 20:20:35,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=230, Invalid=1410, Unknown=0, NotChecked=0, Total=1640 [2022-11-18 20:20:35,345 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 229 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:35,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 498 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 351 Invalid, 0 Unknown, 42 Unchecked, 0.6s Time] [2022-11-18 20:20:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-18 20:20:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2022-11-18 20:20:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.1727272727272726) internal successors, (129), 116 states have internal predecessors, (129), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-18 20:20:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2022-11-18 20:20:35,351 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 63 [2022-11-18 20:20:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:35,351 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-11-18 20:20:35,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:20:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2022-11-18 20:20:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:20:35,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:35,353 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:35,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:35,566 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 445375639, now seen corresponding path program 1 times [2022-11-18 20:20:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:35,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21925105] [2022-11-18 20:20:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:35,567 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-18 20:20:35,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:35,568 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:35,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-18 20:20:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:35,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:20:35,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:36,534 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 15 treesize of output 11 [2022-11-18 20:20:37,074 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-18 20:20:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-18 20:20:37,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-18 20:20:37,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21925105] [2022-11-18 20:20:37,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21925105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:37,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:37,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 22 [2022-11-18 20:20:37,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014731747] [2022-11-18 20:20:37,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:37,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:20:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:20:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:20:37,655 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 20 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:37,963 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2022-11-18 20:20:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:20:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 20 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2022-11-18 20:20:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:37,965 INFO L225 Difference]: With dead ends: 190 [2022-11-18 20:20:37,965 INFO L226 Difference]: Without dead ends: 190 [2022-11-18 20:20:37,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-18 20:20:37,966 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 37 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 549 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-11-18 20:20:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-18 20:20:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 165. [2022-11-18 20:20:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 138 states have (on average 1.1956521739130435) internal successors, (165), 146 states have internal predecessors, (165), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2022-11-18 20:20:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2022-11-18 20:20:37,972 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 64 [2022-11-18 20:20:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:37,972 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2022-11-18 20:20:37,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 20 states have internal predecessors, (59), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2022-11-18 20:20:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:20:37,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:37,974 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:37,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:38,183 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 36551414, now seen corresponding path program 2 times [2022-11-18 20:20:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843626281] [2022-11-18 20:20:38,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:20:38,184 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-18 20:20:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:38,185 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:38,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-18 20:20:38,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:20:38,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:20:38,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:20:38,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:38,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:20:38,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:38,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843626281] [2022-11-18 20:20:38,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843626281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:20:38,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:20:38,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:20:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329467686] [2022-11-18 20:20:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:20:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:20:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:20:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:20:38,467 INFO L87 Difference]: Start difference. First operand 165 states and 194 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:38,495 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2022-11-18 20:20:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:20:38,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2022-11-18 20:20:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:38,496 INFO L225 Difference]: With dead ends: 124 [2022-11-18 20:20:38,496 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:20:38,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:20:38,497 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:38,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 170 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:20:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:20:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2022-11-18 20:20:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 101 states have internal predecessors, (107), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:20:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-11-18 20:20:38,502 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 64 [2022-11-18 20:20:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:38,502 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-11-18 20:20:38,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:20:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-11-18 20:20:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 20:20:38,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:38,503 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:38,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-11-18 20:20:38,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:38,716 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 921743024, now seen corresponding path program 1 times [2022-11-18 20:20:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:38,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365810321] [2022-11-18 20:20:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:38,717 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-18 20:20:38,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:38,718 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:38,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-18 20:20:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:38,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:20:38,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:39,060 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-18 20:20:39,142 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 15 treesize of output 11 [2022-11-18 20:20:39,269 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 5 [2022-11-18 20:20:39,383 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 11 [2022-11-18 20:20:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:39,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:20:39,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:39,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365810321] [2022-11-18 20:20:39,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365810321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:39,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:39,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2022-11-18 20:20:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010506715] [2022-11-18 20:20:39,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:39,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:20:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:20:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:20:39,883 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:20:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:41,561 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-11-18 20:20:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:20:41,563 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 65 [2022-11-18 20:20:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:41,564 INFO L225 Difference]: With dead ends: 132 [2022-11-18 20:20:41,566 INFO L226 Difference]: Without dead ends: 130 [2022-11-18 20:20:41,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:20:41,567 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 98 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:41,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 494 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 560 Invalid, 0 Unknown, 46 Unchecked, 0.9s Time] [2022-11-18 20:20:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-18 20:20:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2022-11-18 20:20:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.134020618556701) internal successors, (110), 103 states have internal predecessors, (110), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:20:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2022-11-18 20:20:41,581 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 65 [2022-11-18 20:20:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:41,582 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2022-11-18 20:20:41,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:20:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-11-18 20:20:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 20:20:41,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:41,583 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:41,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:41,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:41,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1490737222, now seen corresponding path program 1 times [2022-11-18 20:20:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:41,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545466676] [2022-11-18 20:20:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:41,804 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-18 20:20:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:41,806 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:41,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-18 20:20:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:42,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-18 20:20:42,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:42,050 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-18 20:20:42,345 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:20:42,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:20:42,446 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 15 treesize of output 11 [2022-11-18 20:20:42,566 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 7 treesize of output 5 [2022-11-18 20:20:46,779 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 16 treesize of output 8 [2022-11-18 20:20:46,835 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 14 treesize of output 20 [2022-11-18 20:20:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-18 20:20:46,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-11-18 20:20:47,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:47,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545466676] [2022-11-18 20:20:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545466676] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:20:47,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2022-11-18 20:20:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81208610] [2022-11-18 20:20:47,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:20:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:20:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=620, Unknown=1, NotChecked=0, Total=702 [2022-11-18 20:20:47,830 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:49,993 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-11-18 20:20:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:20:49,994 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 66 [2022-11-18 20:20:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:49,995 INFO L225 Difference]: With dead ends: 137 [2022-11-18 20:20:49,995 INFO L226 Difference]: Without dead ends: 137 [2022-11-18 20:20:49,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=175, Invalid=1464, Unknown=1, NotChecked=0, Total=1640 [2022-11-18 20:20:49,996 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:49,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 598 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 686 Invalid, 0 Unknown, 56 Unchecked, 1.1s Time] [2022-11-18 20:20:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-18 20:20:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2022-11-18 20:20:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 106 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:20:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2022-11-18 20:20:50,001 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 66 [2022-11-18 20:20:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:50,001 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2022-11-18 20:20:50,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 23 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-11-18 20:20:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-18 20:20:50,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:50,003 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:20:50,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-18 20:20:50,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:50,215 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:20:50,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash -280378112, now seen corresponding path program 2 times [2022-11-18 20:20:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:20:50,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226834240] [2022-11-18 20:20:50,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:20:50,216 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-18 20:20:50,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:20:50,217 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:20:50,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-18 20:20:50,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:20:50,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:20:50,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:20:50,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:50,594 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-18 20:20:50,601 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-18 20:20:51,091 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_1481 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_1481) |c_#length|)))) is different from true [2022-11-18 20:20:51,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:51,114 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-18 20:20:51,131 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:51,131 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-18 20:20:51,272 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1482 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_1482) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:20:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:51,291 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-18 20:20:51,302 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:51,303 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-18 20:20:51,445 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_1483 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_1483))))) is different from true [2022-11-18 20:20:51,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:51,472 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-18 20:20:51,485 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:51,485 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-18 20:20:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 151 trivial. 12 not checked. [2022-11-18 20:20:51,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:56,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:20:56,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226834240] [2022-11-18 20:20:56,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226834240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:56,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [260346191] [2022-11-18 20:20:56,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:20:56,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:20:56,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:20:56,033 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:20:56,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-11-18 20:20:56,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:20:56,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:20:56,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:20:56,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:56,652 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-18 20:20:56,658 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-18 20:20:56,989 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_1569 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_1569) |c_#length|)))) is different from true [2022-11-18 20:20:57,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:57,006 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-18 20:20:57,022 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:57,022 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-18 20:20:57,097 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_1570 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_1570) |c_#length|)))) is different from true [2022-11-18 20:20:57,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:57,120 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-18 20:20:57,138 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:57,139 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-18 20:20:57,223 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_1571 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_1571) |c_#length|)))) is different from true [2022-11-18 20:20:57,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:57,251 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-18 20:20:57,264 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:20:57,264 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-18 20:20:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 151 trivial. 12 not checked. [2022-11-18 20:20:57,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:20:59,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [260346191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:59,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:20:59,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2022-11-18 20:20:59,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803611177] [2022-11-18 20:20:59,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:20:59,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:20:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:20:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:20:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=204, Unknown=7, NotChecked=198, Total=462 [2022-11-18 20:20:59,610 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:21:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:00,462 INFO L93 Difference]: Finished difference Result 174 states and 181 transitions. [2022-11-18 20:21:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:21:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2022-11-18 20:21:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:00,464 INFO L225 Difference]: With dead ends: 174 [2022-11-18 20:21:00,464 INFO L226 Difference]: Without dead ends: 174 [2022-11-18 20:21:00,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=68, Invalid=291, Unknown=7, NotChecked=234, Total=600 [2022-11-18 20:21:00,465 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 96 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:00,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 410 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 388 Invalid, 0 Unknown, 512 Unchecked, 0.6s Time] [2022-11-18 20:21:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-18 20:21:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 118. [2022-11-18 20:21:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.121212121212121) internal successors, (111), 106 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:21:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2022-11-18 20:21:00,470 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 70 [2022-11-18 20:21:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2022-11-18 20:21:00,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-18 20:21:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2022-11-18 20:21:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-18 20:21:00,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:00,472 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:00,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:00,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:00,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:21:00,885 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:21:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:00,885 INFO L85 PathProgramCache]: Analyzing trace with hash -590692744, now seen corresponding path program 1 times [2022-11-18 20:21:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:21:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609119349] [2022-11-18 20:21:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:00,886 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-18 20:21:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:21:00,887 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:00,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-18 20:21:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:01,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:21:01,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-11-18 20:21:01,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-11-18 20:21:01,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:21:01,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609119349] [2022-11-18 20:21:01,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609119349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:01,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:21:01,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-18 20:21:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205280069] [2022-11-18 20:21:01,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:01,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:21:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:21:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:21:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:21:01,334 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:21:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:01,512 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-11-18 20:21:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:21:01,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 69 [2022-11-18 20:21:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:01,514 INFO L225 Difference]: With dead ends: 142 [2022-11-18 20:21:01,514 INFO L226 Difference]: Without dead ends: 142 [2022-11-18 20:21:01,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:21:01,515 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 75 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:01,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 230 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-18 20:21:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2022-11-18 20:21:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.1132075471698113) internal successors, (118), 113 states have internal predecessors, (118), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:21:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2022-11-18 20:21:01,520 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 69 [2022-11-18 20:21:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:01,520 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2022-11-18 20:21:01,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:21:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2022-11-18 20:21:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-18 20:21:01,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:01,522 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:01,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:01,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:01,736 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:21:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -513282356, now seen corresponding path program 1 times [2022-11-18 20:21:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:21:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948027384] [2022-11-18 20:21:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:01,737 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-18 20:21:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:21:01,738 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:01,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-18 20:21:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:01,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:21:01,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-18 20:21:02,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:02,089 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 20:21:02,090 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 16 treesize of output 15 [2022-11-18 20:21:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-18 20:21:02,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:21:02,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948027384] [2022-11-18 20:21:02,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948027384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:02,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:21:02,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-11-18 20:21:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926409902] [2022-11-18 20:21:02,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:02,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:21:02,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:02,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:02,158 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-18 20:21:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:02,260 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-11-18 20:21:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:21:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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) Word has length 73 [2022-11-18 20:21:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:02,262 INFO L225 Difference]: With dead ends: 130 [2022-11-18 20:21:02,262 INFO L226 Difference]: Without dead ends: 130 [2022-11-18 20:21:02,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 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-18 20:21:02,263 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:02,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-18 20:21:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-18 20:21:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 118 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:21:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2022-11-18 20:21:02,267 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 73 [2022-11-18 20:21:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:02,267 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2022-11-18 20:21:02,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-18 20:21:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-11-18 20:21:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-18 20:21:02,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:02,268 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:02,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:02,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:02,469 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:21:02,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 230335872, now seen corresponding path program 1 times [2022-11-18 20:21:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:21:02,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680453293] [2022-11-18 20:21:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:02,470 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-18 20:21:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:21:02,472 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:02,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-18 20:21:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:02,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:21:02,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:21:02,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:21:02,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:21:02,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680453293] [2022-11-18 20:21:02,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680453293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:21:02,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:21:02,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-18 20:21:02,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486099833] [2022-11-18 20:21:02,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:21:02,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:21:02,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:21:02,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:21:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:21:02,880 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:21:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:03,226 INFO L93 Difference]: Finished difference Result 170 states and 173 transitions. [2022-11-18 20:21:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:21:03,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-11-18 20:21:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:03,228 INFO L225 Difference]: With dead ends: 170 [2022-11-18 20:21:03,228 INFO L226 Difference]: Without dead ends: 170 [2022-11-18 20:21:03,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:21:03,229 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 198 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:03,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 261 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:21:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-18 20:21:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 135. [2022-11-18 20:21:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 122 states have internal predecessors, (127), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:21:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2022-11-18 20:21:03,234 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 76 [2022-11-18 20:21:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:03,234 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2022-11-18 20:21:03,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:21:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2022-11-18 20:21:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-18 20:21:03,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:03,235 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:03,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-18 20:21:03,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:03,450 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:21:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 656898895, now seen corresponding path program 1 times [2022-11-18 20:21:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:21:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424029845] [2022-11-18 20:21:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:03,451 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-18 20:21:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:21:03,452 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:21:03,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-18 20:21:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:03,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 20:21:03,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:04,448 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 15 treesize of output 11 [2022-11-18 20:21:04,636 INFO L321 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-11-18 20:21:04,637 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 36 treesize of output 33 [2022-11-18 20:21:04,829 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 21 [2022-11-18 20:21:17,815 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_27| (_ BitVec 32)) (v_ArrVal_1885 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_1885))) (and (= (store (store .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_27| (_ bv0 1)) |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_27|))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)))) is different from true [2022-11-18 20:21:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-18 20:21:17,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:25,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_alloc_17_#t~ret39#1.base_85| (_ BitVec 32))) (or (= (store (store |c_#valid| |v_ULTIMATE.start_alloc_17_#t~ret39#1.base_85| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_alloc_17_#t~ret39#1.base_85|) (_ bv0 1))))) is different from false [2022-11-18 20:21:25,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:21:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424029845] [2022-11-18 20:21:25,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424029845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:21:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1764825752] [2022-11-18 20:21:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:21:25,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:21:25,602 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:21:25,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-18 20:21:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:26,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:21:26,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:21:36,079 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 15 treesize of output 11 [2022-11-18 20:21:38,453 INFO L321 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-11-18 20:21:38,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 36 [2022-11-18 20:21:39,136 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 21 [2022-11-18 20:21:50,753 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32)) (v_ArrVal_1885 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_29| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_1885))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_29| (_ bv0 1)))) (and (= |c_#valid| (store .cse0 |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_29|)) (= (bvadd (select .cse0 |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1))))))) is different from true [2022-11-18 20:21:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-18 20:21:50,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:21:51,544 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 24 treesize of output 22 [2022-11-18 20:22:00,586 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_alloc_17_#t~ret39#1.base_90| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_alloc_17_#t~ret39#1.base_90| (_ bv0 1)))) (or (= (store .cse0 |c_ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (bvadd (select .cse0 |c_ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_alloc_17_#t~ret39#1.base_90|) (_ bv0 1)))))) is different from false [2022-11-18 20:22:00,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1764825752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:00,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:00,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-11-18 20:22:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614845487] [2022-11-18 20:22:00,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:00,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 20:22:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 20:22:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1819, Unknown=20, NotChecked=356, Total=2352 [2022-11-18 20:22:00,591 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:22:00,759 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_27| (_ BitVec 32)) (v_ArrVal_1885 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_1885))) (and (= (store (store .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_27| (_ bv0 1)) |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_27|))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32)) (v_ArrVal_1885 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_29| (_ BitVec 32))) (let ((.cse2 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_1885))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_29| (_ bv0 1)))) (and (= |c_#valid| (store .cse1 |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_29|)) (= (bvadd (select .cse1 |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1))))))) is different from true [2022-11-18 20:22:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:00,771 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2022-11-18 20:22:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:22:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2022-11-18 20:22:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:00,772 INFO L225 Difference]: With dead ends: 142 [2022-11-18 20:22:00,772 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:22:00,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=170, Invalid=1991, Unknown=21, NotChecked=470, Total=2652 [2022-11-18 20:22:00,775 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:00,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 440 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 298 Unchecked, 0.0s Time] [2022-11-18 20:22:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:22:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-18 20:22:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.0857142857142856) internal successors, (114), 110 states have internal predecessors, (114), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-18 20:22:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2022-11-18 20:22:00,779 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 75 [2022-11-18 20:22:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:00,780 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2022-11-18 20:22:00,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:22:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-11-18 20:22:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-18 20:22:00,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:00,781 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:00,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:01,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:01,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:01,195 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:22:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1246142796, now seen corresponding path program 3 times [2022-11-18 20:22:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:01,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112361877] [2022-11-18 20:22:01,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:22:01,196 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-18 20:22:01,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:01,197 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:01,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-18 20:22:01,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:22:01,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:22:01,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-18 20:22:01,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:01,480 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-18 20:22:01,486 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-18 20:22:01,935 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_2071 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_2071))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:22:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:01,958 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-18 20:22:01,974 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:01,975 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-18 20:22:02,129 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_2072 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_2072) |c_#length|)))) is different from true [2022-11-18 20:22:02,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:02,164 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-18 20:22:02,176 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:02,176 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-18 20:22:02,322 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_2073 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_2073))))) is different from true [2022-11-18 20:22:02,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:02,341 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-18 20:22:02,356 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:02,356 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-18 20:22:02,520 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_2074 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_2074) |c_#length|)))) is different from true [2022-11-18 20:22:02,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:02,539 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-18 20:22:02,552 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:02,552 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-18 20:22:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 157 trivial. 20 not checked. [2022-11-18 20:22:02,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:05,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112361877] [2022-11-18 20:22:05,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112361877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:05,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1387774724] [2022-11-18 20:22:05,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:22:05,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:22:05,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:22:05,099 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:22:05,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-18 20:22:05,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:22:05,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:22:05,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-18 20:22:05,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:05,597 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-18 20:22:05,601 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-18 20:22:06,016 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:22:06,016 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 12 treesize of output 18 [2022-11-18 20:22:06,041 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:06,042 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-18 20:22:06,319 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:22:06,319 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 12 treesize of output 18 [2022-11-18 20:22:06,340 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:06,341 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-18 20:22:06,532 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_2172 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_2172))))) is different from true [2022-11-18 20:22:06,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:06,557 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-18 20:22:06,572 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:06,572 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-18 20:22:06,653 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_2173 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_2173))))) is different from true [2022-11-18 20:22:06,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:06,669 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-18 20:22:06,680 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:06,681 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-18 20:22:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 159 trivial. 14 not checked. [2022-11-18 20:22:06,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:07,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1387774724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:07,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:07,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 26 [2022-11-18 20:22:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921244784] [2022-11-18 20:22:07,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:07,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:22:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:22:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=445, Unknown=6, NotChecked=282, Total=812 [2022-11-18 20:22:07,057 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 27 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-18 20:22:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:08,580 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2022-11-18 20:22:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:22:08,581 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 80 [2022-11-18 20:22:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:08,582 INFO L225 Difference]: With dead ends: 176 [2022-11-18 20:22:08,582 INFO L226 Difference]: Without dead ends: 176 [2022-11-18 20:22:08,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=109, Invalid=665, Unknown=6, NotChecked=342, Total=1122 [2022-11-18 20:22:08,583 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 59 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:08,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 683 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 775 Invalid, 0 Unknown, 575 Unchecked, 1.1s Time] [2022-11-18 20:22:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-18 20:22:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 126. [2022-11-18 20:22:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.0833333333333333) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-18 20:22:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2022-11-18 20:22:08,587 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 80 [2022-11-18 20:22:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:08,587 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2022-11-18 20:22:08,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 8 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-18 20:22:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-11-18 20:22:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-18 20:22:08,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:08,588 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:08,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:08,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:08,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:08,989 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:22:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1176035772, now seen corresponding path program 2 times [2022-11-18 20:22:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:08,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541739374] [2022-11-18 20:22:08,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:22:08,990 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-18 20:22:08,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:08,991 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:08,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-18 20:22:09,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:22:09,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:22:09,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:22:09,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-18 20:22:09,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:10,081 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 34 treesize of output 30 [2022-11-18 20:22:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-18 20:22:12,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:12,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541739374] [2022-11-18 20:22:12,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541739374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:22:12,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:12,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-11-18 20:22:12,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217685519] [2022-11-18 20:22:12,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:12,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:22:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:22:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:22:12,172 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 19 states have internal predecessors, (70), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 20:22:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:21,626 INFO L93 Difference]: Finished difference Result 311 states and 324 transitions. [2022-11-18 20:22:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:22:21,628 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 19 states have internal predecessors, (70), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 79 [2022-11-18 20:22:21,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:21,630 INFO L225 Difference]: With dead ends: 311 [2022-11-18 20:22:21,630 INFO L226 Difference]: Without dead ends: 311 [2022-11-18 20:22:21,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=484, Invalid=1772, Unknown=0, NotChecked=0, Total=2256 [2022-11-18 20:22:21,631 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 860 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:21,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 501 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-18 20:22:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-18 20:22:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 159. [2022-11-18 20:22:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-18 20:22:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2022-11-18 20:22:21,638 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 79 [2022-11-18 20:22:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:21,638 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2022-11-18 20:22:21,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 19 states have internal predecessors, (70), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 20:22:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2022-11-18 20:22:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-18 20:22:21,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:21,640 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:21,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:21,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:21,855 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:22:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2097370558, now seen corresponding path program 1 times [2022-11-18 20:22:21,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:21,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547742763] [2022-11-18 20:22:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:21,856 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-18 20:22:21,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:21,858 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:21,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-18 20:22:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:22,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:22:22,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:22,402 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 15 treesize of output 11 [2022-11-18 20:22:22,591 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 28 treesize of output 27 [2022-11-18 20:22:22,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:22,842 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 23 treesize of output 22 [2022-11-18 20:22:22,906 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-18 20:22:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-18 20:22:22,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-18 20:22:23,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:23,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547742763] [2022-11-18 20:22:23,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547742763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:22:23,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:23,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2022-11-18 20:22:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298185363] [2022-11-18 20:22:23,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:23,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:22:23,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:23,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:22:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:22:23,446 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 19 states have internal predecessors, (73), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-18 20:22:26,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:22:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:27,857 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2022-11-18 20:22:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:22:27,858 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 19 states have internal predecessors, (73), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 80 [2022-11-18 20:22:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:27,859 INFO L225 Difference]: With dead ends: 211 [2022-11-18 20:22:27,859 INFO L226 Difference]: Without dead ends: 211 [2022-11-18 20:22:27,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=391, Invalid=2579, Unknown=0, NotChecked=0, Total=2970 [2022-11-18 20:22:27,860 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 333 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:27,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 662 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 561 Invalid, 0 Unknown, 46 Unchecked, 2.5s Time] [2022-11-18 20:22:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-18 20:22:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2022-11-18 20:22:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.1666666666666667) internal successors, (175), 156 states have internal predecessors, (175), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-18 20:22:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2022-11-18 20:22:27,866 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 80 [2022-11-18 20:22:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:27,866 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2022-11-18 20:22:27,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 19 states have internal predecessors, (73), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-18 20:22:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2022-11-18 20:22:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-18 20:22:27,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:27,868 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:27,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:28,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:28,082 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:22:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -593977757, now seen corresponding path program 1 times [2022-11-18 20:22:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:28,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683357009] [2022-11-18 20:22:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:28,083 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-18 20:22:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:28,085 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:28,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-18 20:22:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:28,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:22:28,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:28,685 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 15 treesize of output 11 [2022-11-18 20:22:28,976 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 28 treesize of output 27 [2022-11-18 20:22:29,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:29,274 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 23 treesize of output 22 [2022-11-18 20:22:29,346 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-18 20:22:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-18 20:22:29,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-18 20:22:30,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683357009] [2022-11-18 20:22:30,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683357009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:22:30,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:30,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2022-11-18 20:22:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735302492] [2022-11-18 20:22:30,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:30,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:22:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:22:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:22:30,037 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 20 states have internal predecessors, (76), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-18 20:22:34,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:22:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:37,191 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2022-11-18 20:22:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:22:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 20 states have internal predecessors, (76), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 81 [2022-11-18 20:22:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:37,193 INFO L225 Difference]: With dead ends: 208 [2022-11-18 20:22:37,194 INFO L226 Difference]: Without dead ends: 208 [2022-11-18 20:22:37,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=399, Invalid=2793, Unknown=0, NotChecked=0, Total=3192 [2022-11-18 20:22:37,195 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 281 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:37,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 587 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 803 Invalid, 1 Unknown, 54 Unchecked, 4.1s Time] [2022-11-18 20:22:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-18 20:22:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 173. [2022-11-18 20:22:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.1589403973509933) internal successors, (175), 157 states have internal predecessors, (175), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-18 20:22:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 196 transitions. [2022-11-18 20:22:37,200 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 196 transitions. Word has length 81 [2022-11-18 20:22:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:37,201 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 196 transitions. [2022-11-18 20:22:37,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 20 states have internal predecessors, (76), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-18 20:22:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 196 transitions. [2022-11-18 20:22:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-18 20:22:37,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:37,202 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:37,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-11-18 20:22:37,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:37,415 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:22:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1233441180, now seen corresponding path program 1 times [2022-11-18 20:22:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:37,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137461124] [2022-11-18 20:22:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:37,417 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-18 20:22:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:37,418 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:37,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-18 20:22:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:37,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-18 20:22:37,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:37,918 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-18 20:22:38,006 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 15 treesize of output 11 [2022-11-18 20:22:38,109 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 5 [2022-11-18 20:22:38,200 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:22:38,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:22:38,389 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 45 treesize of output 35 [2022-11-18 20:22:38,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:22:38,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:38,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 20:22:38,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:38,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:22:38,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:22:38,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-18 20:22:39,112 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 11 [2022-11-18 20:22:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 10 proven. 59 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-18 20:22:39,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:39,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137461124] [2022-11-18 20:22:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137461124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033504835] [2022-11-18 20:22:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:22:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:22:39,923 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:22:39,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-18 20:22:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:41,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:22:41,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:41,708 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-18 20:22:41,754 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 15 treesize of output 11 [2022-11-18 20:22:41,791 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 5 [2022-11-18 20:22:41,875 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:22:41,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:22:41,932 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 45 treesize of output 35 [2022-11-18 20:22:41,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:22:42,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:42,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 20:22:42,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:42,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:22:42,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:22:42,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-18 20:22:42,324 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 11 [2022-11-18 20:22:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 10 proven. 59 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-18 20:22:42,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2033504835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:22:42,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:42,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-11-18 20:22:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755514854] [2022-11-18 20:22:42,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:42,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 20:22:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 20:22:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-11-18 20:22:42,582 INFO L87 Difference]: Start difference. First operand 173 states and 196 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 21 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:22:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:43,992 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2022-11-18 20:22:43,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:22:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 21 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 82 [2022-11-18 20:22:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:43,994 INFO L225 Difference]: With dead ends: 173 [2022-11-18 20:22:43,994 INFO L226 Difference]: Without dead ends: 173 [2022-11-18 20:22:43,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 20:22:43,995 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:43,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 469 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 650 Invalid, 0 Unknown, 111 Unchecked, 1.1s Time] [2022-11-18 20:22:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-18 20:22:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-11-18 20:22:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.1523178807947019) internal successors, (174), 157 states have internal predecessors, (174), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-18 20:22:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2022-11-18 20:22:44,000 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 82 [2022-11-18 20:22:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:44,000 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2022-11-18 20:22:44,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 21 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:22:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2022-11-18 20:22:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-18 20:22:44,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:44,001 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:44,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:44,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2022-11-18 20:22:44,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:22:44,402 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:22:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 418029190, now seen corresponding path program 1 times [2022-11-18 20:22:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:44,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72942667] [2022-11-18 20:22:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:44,403 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-18 20:22:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:44,404 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:22:44,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-18 20:22:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:44,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 20:22:44,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:44,770 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-18 20:22:45,047 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:22:45,047 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-18 20:22:45,131 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 15 treesize of output 11 [2022-11-18 20:22:47,229 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_57| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_57|) (_ bv0 32)) |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_57|))) is different from true [2022-11-18 20:22:47,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:47,312 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 24 treesize of output 23 [2022-11-18 20:22:49,375 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_58| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_58|) (_ bv0 32)) |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_58|))) is different from true [2022-11-18 20:22:49,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:49,543 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 24 treesize of output 23 [2022-11-18 20:22:49,666 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 16 treesize of output 8 [2022-11-18 20:22:49,723 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 14 treesize of output 20 [2022-11-18 20:22:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 16 not checked. [2022-11-18 20:22:49,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:22:50,050 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 8 treesize of output 6 [2022-11-18 20:22:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-18 20:22:50,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:50,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72942667] [2022-11-18 20:22:50,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72942667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:22:50,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:22:50,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2022-11-18 20:22:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878962503] [2022-11-18 20:22:50,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:22:50,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-18 20:22:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:50,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-18 20:22:50,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=794, Unknown=2, NotChecked=114, Total=992 [2022-11-18 20:22:50,973 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 28 states have internal predecessors, (85), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 20:23:07,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:23:08,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:23:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:09,883 INFO L93 Difference]: Finished difference Result 189 states and 208 transitions. [2022-11-18 20:23:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-18 20:23:09,884 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 28 states have internal predecessors, (85), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 83 [2022-11-18 20:23:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:09,884 INFO L225 Difference]: With dead ends: 189 [2022-11-18 20:23:09,884 INFO L226 Difference]: Without dead ends: 189 [2022-11-18 20:23:09,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 129 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=290, Invalid=2794, Unknown=4, NotChecked=218, Total=3306 [2022-11-18 20:23:09,886 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 154 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:09,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 693 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1038 Invalid, 0 Unknown, 251 Unchecked, 4.6s Time] [2022-11-18 20:23:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-18 20:23:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2022-11-18 20:23:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.1503267973856208) internal successors, (176), 159 states have internal predecessors, (176), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-18 20:23:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2022-11-18 20:23:09,891 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 83 [2022-11-18 20:23:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:09,892 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-11-18 20:23:09,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 28 states have internal predecessors, (85), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 20:23:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2022-11-18 20:23:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-18 20:23:09,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:09,893 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:09,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-11-18 20:23:10,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:10,107 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:23:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1306673498, now seen corresponding path program 2 times [2022-11-18 20:23:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:10,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782104600] [2022-11-18 20:23:10,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:23:10,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-18 20:23:10,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:10,110 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:10,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-18 20:23:10,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:23:10,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:23:10,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:23:10,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:23:10,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:23:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:23:10,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:23:10,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782104600] [2022-11-18 20:23:10,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782104600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:23:10,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:23:10,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-18 20:23:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934376888] [2022-11-18 20:23:10,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:23:10,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:23:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:23:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:23:10,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:23:10,817 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:23:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:11,117 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2022-11-18 20:23:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:23:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 87 [2022-11-18 20:23:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:11,120 INFO L225 Difference]: With dead ends: 182 [2022-11-18 20:23:11,120 INFO L226 Difference]: Without dead ends: 182 [2022-11-18 20:23:11,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:23:11,121 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 85 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:11,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 414 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:23:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-18 20:23:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 167. [2022-11-18 20:23:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 151 states have internal predecessors, (162), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-18 20:23:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 183 transitions. [2022-11-18 20:23:11,127 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 183 transitions. Word has length 87 [2022-11-18 20:23:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:11,127 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 183 transitions. [2022-11-18 20:23:11,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:23:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 183 transitions. [2022-11-18 20:23:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 20:23:11,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:11,128 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:11,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Ended with exit code 0 [2022-11-18 20:23:11,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:11,341 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:23:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash -891953512, now seen corresponding path program 1 times [2022-11-18 20:23:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150249580] [2022-11-18 20:23:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:11,342 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-18 20:23:11,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:11,345 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:11,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-18 20:23:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:11,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:23:11,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-18 20:23:11,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:23:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-18 20:23:12,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:23:12,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150249580] [2022-11-18 20:23:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150249580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:23:12,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:23:12,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-18 20:23:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757208643] [2022-11-18 20:23:12,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:23:12,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:23:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:23:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:23:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:23:12,402 INFO L87 Difference]: Start difference. First operand 167 states and 183 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-18 20:23:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:13,237 INFO L93 Difference]: Finished difference Result 414 states and 445 transitions. [2022-11-18 20:23:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:23:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 89 [2022-11-18 20:23:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:13,239 INFO L225 Difference]: With dead ends: 414 [2022-11-18 20:23:13,239 INFO L226 Difference]: Without dead ends: 414 [2022-11-18 20:23:13,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2022-11-18 20:23:13,240 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 700 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:13,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 612 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:23:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-18 20:23:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 190. [2022-11-18 20:23:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 165 states have (on average 1.1151515151515152) internal successors, (184), 170 states have internal predecessors, (184), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2022-11-18 20:23:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2022-11-18 20:23:13,259 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 89 [2022-11-18 20:23:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:13,259 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2022-11-18 20:23:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-18 20:23:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2022-11-18 20:23:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-18 20:23:13,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:13,260 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:13,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-18 20:23:13,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:13,474 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:23:13,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -586455192, now seen corresponding path program 4 times [2022-11-18 20:23:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:13,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24871067] [2022-11-18 20:23:13,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:23:13,475 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-18 20:23:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:13,476 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:13,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-18 20:23:13,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:23:13,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:23:13,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-18 20:23:13,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:13,971 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-18 20:23:13,977 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-18 20:23:14,394 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3012 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3012))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:23:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:14,410 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-18 20:23:14,421 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:14,421 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-18 20:23:14,554 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3013 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3013) |c_#length|)))) is different from true [2022-11-18 20:23:14,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:14,577 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-18 20:23:14,591 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:14,591 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-18 20:23:14,727 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3014 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3014))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:23:14,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:14,748 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-18 20:23:14,763 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:14,764 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-18 20:23:14,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3015 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3015) |c_#length|)))) is different from true [2022-11-18 20:23:14,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:14,927 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-18 20:23:14,938 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:14,938 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-18 20:23:15,095 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3016 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3016) |c_#length|)))) is different from true [2022-11-18 20:23:15,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:15,112 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-18 20:23:15,122 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:15,122 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-18 20:23:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 5 proven. 61 refuted. 0 times theorem prover too weak. 165 trivial. 30 not checked. [2022-11-18 20:23:15,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:23:19,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:23:19,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24871067] [2022-11-18 20:23:19,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24871067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:23:19,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1854748440] [2022-11-18 20:23:19,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:23:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:23:19,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:23:19,721 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:23:19,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-18 20:23:20,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:23:20,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:23:20,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-18 20:23:20,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:20,613 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-18 20:23:20,622 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-18 20:23:21,017 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3118 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3118) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:23:21,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:21,043 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-18 20:23:21,060 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:21,061 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-18 20:23:21,134 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3119 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3119) |c_#length|)))) is different from true [2022-11-18 20:23:21,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:21,153 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-18 20:23:21,167 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:21,168 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-18 20:23:21,242 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3120 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3120) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:23:21,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:21,262 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-18 20:23:21,276 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:21,277 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-18 20:23:21,361 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3121 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3121))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:23:21,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:21,380 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-18 20:23:21,395 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:21,395 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-18 20:23:21,470 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3122 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3122) |c_#length|)))) is different from true [2022-11-18 20:23:21,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:21,488 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-18 20:23:21,499 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:23:21,499 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-18 20:23:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 5 proven. 61 refuted. 0 times theorem prover too weak. 165 trivial. 30 not checked. [2022-11-18 20:23:21,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:23:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1854748440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:23:21,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:23:21,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 27 [2022-11-18 20:23:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572521539] [2022-11-18 20:23:21,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:23:21,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:23:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:23:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:23:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=333, Unknown=10, NotChecked=450, Total=870 [2022-11-18 20:23:21,885 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand has 28 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 27 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 11 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-18 20:23:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:23,253 INFO L93 Difference]: Finished difference Result 270 states and 296 transitions. [2022-11-18 20:23:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:23:23,253 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 27 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 11 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 90 [2022-11-18 20:23:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:23,254 INFO L225 Difference]: With dead ends: 270 [2022-11-18 20:23:23,254 INFO L226 Difference]: Without dead ends: 270 [2022-11-18 20:23:23,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=92, Invalid=444, Unknown=10, NotChecked=510, Total=1056 [2022-11-18 20:23:23,255 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 126 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1117 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:23,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 746 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 664 Invalid, 0 Unknown, 1117 Unchecked, 1.0s Time] [2022-11-18 20:23:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-18 20:23:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2022-11-18 20:23:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 165 states have (on average 1.1090909090909091) internal successors, (183), 170 states have internal predecessors, (183), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2022-11-18 20:23:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2022-11-18 20:23:23,262 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 90 [2022-11-18 20:23:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:23,262 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2022-11-18 20:23:23,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 27 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 11 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-18 20:23:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2022-11-18 20:23:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-18 20:23:23,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:23,263 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:23,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-18 20:23:23,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-11-18 20:23:23,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:23,671 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:23:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1366153752, now seen corresponding path program 2 times [2022-11-18 20:23:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:23,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171445796] [2022-11-18 20:23:23,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:23:23,672 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-18 20:23:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:23,673 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:23,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-18 20:23:24,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:23:24,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:23:24,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:23:24,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:24,359 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-18 20:23:24,459 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 15 treesize of output 11 [2022-11-18 20:23:24,556 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 5 [2022-11-18 20:23:24,661 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2022-11-18 20:23:24,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2022-11-18 20:23:24,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:24,814 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 39 treesize of output 32 [2022-11-18 20:23:25,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:23:25,455 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 28 treesize of output 34 [2022-11-18 20:23:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:25,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:23:25,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2022-11-18 20:23:25,634 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 11 [2022-11-18 20:23:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 102 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-18 20:23:25,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:23:26,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:23:26,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171445796] [2022-11-18 20:23:26,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171445796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:23:26,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [237125464] [2022-11-18 20:23:26,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:23:26,639 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:23:26,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:23:26,640 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:23:26,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2022-11-18 20:23:27,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (50)] Forceful destruction successful, exit code 1 [2022-11-18 20:23:27,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:23:27,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881813494] [2022-11-18 20:23:27,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:23:27,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:23:27,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:23:27,307 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:23:27,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-18 20:23:27,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:23:27,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:23:27,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-18 20:23:27,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:27,889 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-18 20:23:28,567 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 15 treesize of output 11 [2022-11-18 20:23:28,990 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-18 20:23:29,203 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 15 treesize of output 11 [2022-11-18 20:23:29,474 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 5 [2022-11-18 20:23:29,554 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:23:29,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:23:29,953 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 45 treesize of output 35 [2022-11-18 20:23:30,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:23:30,679 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 28 treesize of output 34 [2022-11-18 20:23:30,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:30,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:23:30,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2022-11-18 20:23:30,744 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 11 [2022-11-18 20:23:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 20:23:30,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:23:32,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881813494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:23:32,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:23:32,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 43 [2022-11-18 20:23:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142478088] [2022-11-18 20:23:32,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:23:32,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-18 20:23:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:23:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-18 20:23:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2768, Unknown=0, NotChecked=0, Total=2970 [2022-11-18 20:23:32,044 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand has 44 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 38 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:23:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:35,586 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2022-11-18 20:23:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-18 20:23:35,587 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 38 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 92 [2022-11-18 20:23:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:35,588 INFO L225 Difference]: With dead ends: 219 [2022-11-18 20:23:35,588 INFO L226 Difference]: Without dead ends: 219 [2022-11-18 20:23:35,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 159 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=387, Invalid=5163, Unknown=0, NotChecked=0, Total=5550 [2022-11-18 20:23:35,589 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 174 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:35,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 895 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1330 Invalid, 0 Unknown, 126 Unchecked, 2.1s Time] [2022-11-18 20:23:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-18 20:23:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2022-11-18 20:23:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 189 states have internal predecessors, (203), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2022-11-18 20:23:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2022-11-18 20:23:35,595 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 92 [2022-11-18 20:23:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:35,595 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2022-11-18 20:23:35,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 38 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:23:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2022-11-18 20:23:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-18 20:23:35,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:35,597 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:35,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-11-18 20:23:35,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-11-18 20:23:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:36,006 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:23:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1739385347, now seen corresponding path program 2 times [2022-11-18 20:23:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:36,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217201855] [2022-11-18 20:23:36,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:23:36,007 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-18 20:23:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:36,008 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:23:36,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-11-18 20:23:36,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:23:36,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:23:36,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-18 20:23:36,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:37,043 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 15 treesize of output 11 [2022-11-18 20:23:37,257 INFO L321 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-11-18 20:23:37,258 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 36 treesize of output 33 [2022-11-18 20:23:37,541 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 74 treesize of output 55 [2022-11-18 20:23:37,872 INFO L321 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-11-18 20:23:37,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 132 [2022-11-18 20:23:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:23:38,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:23:38,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:23:38,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 65 [2022-11-18 20:23:40,958 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 51 treesize of output 35 [2022-11-18 20:23:53,515 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59| (_ BitVec 32)) (v_ArrVal_3517 (_ BitVec 1)) (v_ArrVal_3529 (_ BitVec 1)) (v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_3529))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59| v_ArrVal_3517))) (and (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_171 (_ bv0 1)) |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59| (_ bv0 1)) |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1))) (= (select .cse1 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 v_arrayElimCell_171)))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)))) is different from true [2022-11-18 20:23:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-18 20:23:53,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:24:23,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:24:23,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217201855] [2022-11-18 20:24:23,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217201855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:24:23,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [789827436] [2022-11-18 20:24:23,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:24:23,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:24:23,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:24:23,083 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:24:23,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2022-11-18 20:24:25,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:24:25,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:24:25,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-18 20:24:25,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:24:41,184 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 15 treesize of output 11 [2022-11-18 20:24:43,878 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-18 20:24:43,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-18 20:24:44,577 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 74 treesize of output 55 [2022-11-18 20:24:45,306 INFO L321 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2022-11-18 20:24:45,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 45 [2022-11-18 20:24:58,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:24:58,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 55 [2022-11-18 20:24:59,035 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 51 treesize of output 35 [2022-11-18 20:25:05,782 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)) (= (select .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63|) (_ bv0 1)) (= (select .cse1 v_arrayElimCell_181) (_ bv0 1)) (= |c_#valid| (store (store (store .cse1 v_arrayElimCell_181 (_ bv0 1)) |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63| (_ bv0 1)) |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1)))))))) is different from true [2022-11-18 20:25:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-18 20:25:05,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [789827436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:25:35,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:25:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 49 [2022-11-18 20:25:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531676771] [2022-11-18 20:25:35,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:35,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-18 20:25:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:25:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-18 20:25:35,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3537, Unknown=37, NotChecked=242, Total=4032 [2022-11-18 20:25:35,063 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 50 states, 47 states have (on average 2.25531914893617) internal successors, (106), 44 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-18 20:25:49,332 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)) (= (select .cse0 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63|) (_ bv0 1)) (= (select .cse1 v_arrayElimCell_181) (_ bv0 1)) (= |c_#valid| (store (store (store .cse1 v_arrayElimCell_181 (_ bv0 1)) |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_63| (_ bv0 1)) |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1))))))) (exists ((|ULTIMATE.start_entry_point_~array~0#1.base| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59| (_ BitVec 32)) (v_ArrVal_3517 (_ BitVec 1)) (v_ArrVal_3529 (_ BitVec 1)) (v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_3529))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59| v_ArrVal_3517))) (and (= |c_#valid| (store (store (store .cse2 v_arrayElimCell_171 (_ bv0 1)) |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59| (_ bv0 1)) |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 1))) (= (select .cse3 |v_ULTIMATE.start_alloc_17_#t~mem41#1.base_59|) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_arrayElimCell_171)))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1))))) is different from true [2022-11-18 20:25:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:25:49,377 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2022-11-18 20:25:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:25:49,377 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.25531914893617) internal successors, (106), 44 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 92 [2022-11-18 20:25:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:25:49,379 INFO L225 Difference]: With dead ends: 218 [2022-11-18 20:25:49,379 INFO L226 Difference]: Without dead ends: 191 [2022-11-18 20:25:49,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 190 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 126.6s TimeCoverageRelationStatistics Valid=302, Invalid=5070, Unknown=42, NotChecked=438, Total=5852 [2022-11-18 20:25:49,380 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 801 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:25:49,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 677 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 801 Unchecked, 0.3s Time] [2022-11-18 20:25:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-18 20:25:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-18 20:25:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 165 states have (on average 1.1090909090909091) internal successors, (183), 170 states have internal predecessors, (183), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:25:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2022-11-18 20:25:49,390 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 92 [2022-11-18 20:25:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:25:49,390 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2022-11-18 20:25:49,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.25531914893617) internal successors, (106), 44 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-18 20:25:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2022-11-18 20:25:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-18 20:25:49,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:25:49,391 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:25:49,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:49,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2022-11-18 20:25:49,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:25:49,806 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:25:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:25:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -730597920, now seen corresponding path program 3 times [2022-11-18 20:25:49,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:25:49,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811037219] [2022-11-18 20:25:49,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:25:49,807 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-18 20:25:49,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:25:49,808 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:25:49,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2022-11-18 20:25:50,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 20:25:50,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:25:50,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:25:50,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:25:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:25:51,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:25:54,236 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 9 [2022-11-18 20:25:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:25:54,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:25:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811037219] [2022-11-18 20:25:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811037219] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:25:54,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:25:54,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2022-11-18 20:25:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967605854] [2022-11-18 20:25:54,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:25:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:25:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:25:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:25:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:25:54,333 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:26:00,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:26:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:03,989 INFO L93 Difference]: Finished difference Result 220 states and 238 transitions. [2022-11-18 20:26:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:26:03,991 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 96 [2022-11-18 20:26:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:26:03,992 INFO L225 Difference]: With dead ends: 220 [2022-11-18 20:26:03,992 INFO L226 Difference]: Without dead ends: 220 [2022-11-18 20:26:03,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-11-18 20:26:03,993 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 346 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:26:03,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 671 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 397 Invalid, 0 Unknown, 34 Unchecked, 6.7s Time] [2022-11-18 20:26:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-18 20:26:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 182. [2022-11-18 20:26:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 156 states have (on average 1.108974358974359) internal successors, (173), 162 states have internal predecessors, (173), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:26:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 202 transitions. [2022-11-18 20:26:03,999 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 202 transitions. Word has length 96 [2022-11-18 20:26:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:26:04,000 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 202 transitions. [2022-11-18 20:26:04,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:26:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 202 transitions. [2022-11-18 20:26:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-18 20:26:04,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:26:04,001 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:04,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:04,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:26:04,211 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:26:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1173699034, now seen corresponding path program 3 times [2022-11-18 20:26:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:26:04,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947700292] [2022-11-18 20:26:04,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:26:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:26:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:26:04,213 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:26:04,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2022-11-18 20:26:04,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:26:04,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:04,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:26:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:04,790 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 15 treesize of output 11 [2022-11-18 20:26:05,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:05,010 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 23 treesize of output 22 [2022-11-18 20:26:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:05,186 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 23 treesize of output 22 [2022-11-18 20:26:05,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:05,435 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 23 treesize of output 22 [2022-11-18 20:26:05,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:05,545 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 23 treesize of output 22 [2022-11-18 20:26:05,610 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-18 20:26:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-18 20:26:05,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-18 20:26:07,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:26:07,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947700292] [2022-11-18 20:26:07,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947700292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:07,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:07,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2022-11-18 20:26:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525447561] [2022-11-18 20:26:07,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:26:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:26:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:26:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2022-11-18 20:26:07,647 INFO L87 Difference]: Start difference. First operand 182 states and 202 transitions. Second operand has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 26 states have internal predecessors, (97), 8 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-18 20:26:20,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:26:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:23,770 INFO L93 Difference]: Finished difference Result 269 states and 289 transitions. [2022-11-18 20:26:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-18 20:26:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 26 states have internal predecessors, (97), 8 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 97 [2022-11-18 20:26:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:26:23,772 INFO L225 Difference]: With dead ends: 269 [2022-11-18 20:26:23,772 INFO L226 Difference]: Without dead ends: 269 [2022-11-18 20:26:23,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1090, Invalid=5882, Unknown=0, NotChecked=0, Total=6972 [2022-11-18 20:26:23,773 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 549 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 78 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:26:23,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 793 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 903 Invalid, 1 Unknown, 54 Unchecked, 4.4s Time] [2022-11-18 20:26:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-18 20:26:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 208. [2022-11-18 20:26:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 182 states have (on average 1.1758241758241759) internal successors, (214), 188 states have internal predecessors, (214), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:26:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2022-11-18 20:26:23,779 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 97 [2022-11-18 20:26:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:26:23,779 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2022-11-18 20:26:23,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 26 states have internal predecessors, (97), 8 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-18 20:26:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2022-11-18 20:26:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:26:23,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:26:23,781 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:23,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Ended with exit code 0 [2022-11-18 20:26:23,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:26:23,994 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:26:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1547771676, now seen corresponding path program 5 times [2022-11-18 20:26:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:26:23,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819845227] [2022-11-18 20:26:23,995 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:26:23,995 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-18 20:26:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:26:23,996 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:26:23,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2022-11-18 20:26:24,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-18 20:26:24,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:24,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-18 20:26:24,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:24,799 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-18 20:26:25,238 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3957 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3957))))) is different from true [2022-11-18 20:26:25,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:25,256 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-18 20:26:25,274 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:25,274 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-18 20:26:25,438 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3958 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3958) |c_#length|)))) is different from true [2022-11-18 20:26:25,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:25,456 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-18 20:26:25,468 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:25,468 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-18 20:26:25,646 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3959 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3959) |c_#length|)))) is different from true [2022-11-18 20:26:25,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:25,666 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-18 20:26:25,693 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:25,693 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-18 20:26:25,859 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3960 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3960) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:26:25,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:25,879 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-18 20:26:25,891 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:25,892 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-18 20:26:26,064 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_3961 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3961))))) is different from true [2022-11-18 20:26:26,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:26,082 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-18 20:26:26,097 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:26,098 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-18 20:26:26,286 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_3962 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_3962))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2022-11-18 20:26:26,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:26,306 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-18 20:26:26,318 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:26,319 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-18 20:26:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 85 proven. 91 refuted. 0 times theorem prover too weak. 96 trivial. 42 not checked. [2022-11-18 20:26:26,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:27,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:26:27,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819845227] [2022-11-18 20:26:27,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819845227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:26:27,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [358421543] [2022-11-18 20:26:27,004 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:26:27,004 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:26:27,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:26:27,004 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:26:27,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2022-11-18 20:26:31,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-18 20:26:31,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:31,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-18 20:26:31,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:31,180 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-18 20:26:31,449 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_4072 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_4072) |c_#length|)) (exists ((v_ArrVal_4071 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_4071) |c_#valid|)))) is different from true [2022-11-18 20:26:31,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:31,476 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-18 20:26:31,507 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:26:31,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:26:31,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_4074 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_4074))) (exists ((v_ArrVal_4073 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_4073))))) is different from true [2022-11-18 20:26:31,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:31,646 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-18 20:26:31,673 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:26:31,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:26:31,762 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_4075 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_4075) |c_#length|)) (exists ((v_ArrVal_4076 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_4076))))) is different from true [2022-11-18 20:26:31,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:31,787 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-18 20:26:31,814 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:26:31,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:26:31,903 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_4078 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_4078) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_4077 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_4077) |c_#length|)))) is different from true [2022-11-18 20:26:31,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:31,931 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-18 20:26:31,962 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:26:31,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:26:32,069 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_4079 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_4079) |c_#length|)))) is different from true [2022-11-18 20:26:32,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:32,093 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-18 20:26:32,106 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:32,106 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-18 20:26:32,209 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_4080 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_4080) |c_#length|)))) is different from true [2022-11-18 20:26:32,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:32,234 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-18 20:26:32,252 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:26:32,253 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-18 20:26:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 25 proven. 91 refuted. 0 times theorem prover too weak. 156 trivial. 42 not checked. [2022-11-18 20:26:32,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:34,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [358421543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:26:34,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:34,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 32 [2022-11-18 20:26:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947360222] [2022-11-18 20:26:34,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:34,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-18 20:26:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:26:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-18 20:26:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=450, Unknown=12, NotChecked=636, Total=1190 [2022-11-18 20:26:34,738 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand has 33 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 32 states have internal predecessors, (82), 7 states have call successors, (7), 2 states have call predecessors, (7), 13 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-18 20:26:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:26:36,803 INFO L93 Difference]: Finished difference Result 309 states and 349 transitions. [2022-11-18 20:26:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:26:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 32 states have internal predecessors, (82), 7 states have call successors, (7), 2 states have call predecessors, (7), 13 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) Word has length 100 [2022-11-18 20:26:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:26:36,805 INFO L225 Difference]: With dead ends: 309 [2022-11-18 20:26:36,806 INFO L226 Difference]: Without dead ends: 309 [2022-11-18 20:26:36,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=108, Invalid=578, Unknown=12, NotChecked=708, Total=1406 [2022-11-18 20:26:36,806 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 122 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1493 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:26:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 912 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 867 Invalid, 0 Unknown, 1493 Unchecked, 1.4s Time] [2022-11-18 20:26:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-18 20:26:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 208. [2022-11-18 20:26:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 182 states have (on average 1.1703296703296704) internal successors, (213), 188 states have internal predecessors, (213), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:26:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2022-11-18 20:26:36,813 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 100 [2022-11-18 20:26:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:26:36,814 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2022-11-18 20:26:36,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 32 states have internal predecessors, (82), 7 states have call successors, (7), 2 states have call predecessors, (7), 13 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-18 20:26:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2022-11-18 20:26:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-18 20:26:36,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:26:36,815 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:26:36,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:37,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (57)] Forceful destruction successful, exit code 0 [2022-11-18 20:26:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:26:37,230 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:26:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:26:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2024931585, now seen corresponding path program 2 times [2022-11-18 20:26:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:26:37,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396749573] [2022-11-18 20:26:37,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:26:37,231 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-18 20:26:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:26:37,232 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:26:37,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2022-11-18 20:26:37,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:26:37,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:26:37,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-18 20:26:37,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:26:38,005 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 15 treesize of output 11 [2022-11-18 20:26:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:38,256 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 23 treesize of output 22 [2022-11-18 20:26:38,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:38,468 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 23 treesize of output 22 [2022-11-18 20:26:38,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:38,818 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 23 treesize of output 22 [2022-11-18 20:26:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:26:38,952 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 23 treesize of output 22 [2022-11-18 20:26:39,056 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-18 20:26:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 12 proven. 59 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-11-18 20:26:39,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:26:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-18 20:26:40,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:26:40,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396749573] [2022-11-18 20:26:40,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396749573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:26:40,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:26:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2022-11-18 20:26:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326812823] [2022-11-18 20:26:40,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:26:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:26:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:26:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:26:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:26:40,832 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 8 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-18 20:26:48,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:26:50,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:27:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:27:02,349 INFO L93 Difference]: Finished difference Result 281 states and 298 transitions. [2022-11-18 20:27:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-18 20:27:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 8 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 98 [2022-11-18 20:27:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:27:02,352 INFO L225 Difference]: With dead ends: 281 [2022-11-18 20:27:02,352 INFO L226 Difference]: Without dead ends: 281 [2022-11-18 20:27:02,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=945, Invalid=5535, Unknown=0, NotChecked=0, Total=6480 [2022-11-18 20:27:02,353 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 549 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:27:02,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 592 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1166 Invalid, 2 Unknown, 60 Unchecked, 8.2s Time] [2022-11-18 20:27:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-18 20:27:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 209. [2022-11-18 20:27:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 183 states have (on average 1.1530054644808743) internal successors, (211), 189 states have internal predecessors, (211), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:27:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 240 transitions. [2022-11-18 20:27:02,359 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 240 transitions. Word has length 98 [2022-11-18 20:27:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:27:02,359 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 240 transitions. [2022-11-18 20:27:02,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 25 states have internal predecessors, (100), 8 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-18 20:27:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2022-11-18 20:27:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 20:27:02,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:27:02,361 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:27:02,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Ended with exit code 0 [2022-11-18 20:27:02,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:27:02,577 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:27:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1651630408, now seen corresponding path program 3 times [2022-11-18 20:27:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:27:02,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872892004] [2022-11-18 20:27:02,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:27:02,577 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-18 20:27:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:27:02,578 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:27:02,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2022-11-18 20:27:03,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:27:03,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:03,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-18 20:27:03,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:03,157 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-18 20:27:03,262 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 15 treesize of output 11 [2022-11-18 20:27:03,376 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 5 [2022-11-18 20:27:03,501 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:27:03,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:27:03,679 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 45 treesize of output 35 [2022-11-18 20:27:03,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:27:04,104 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:27:04,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:27:04,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:04,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 51 [2022-11-18 20:27:04,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-11-18 20:27:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:05,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 20:27:05,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:05,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:27:05,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:05,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:05,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:05,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2022-11-18 20:27:05,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:05,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 20:27:05,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:05,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:27:05,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:05,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-18 20:27:06,151 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 11 [2022-11-18 20:27:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:27:06,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:08,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:27:08,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872892004] [2022-11-18 20:27:08,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872892004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:08,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [589357423] [2022-11-18 20:27:08,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:27:08,984 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:27:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:27:08,985 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:27:08,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (60)] Waiting until timeout for monitored process [2022-11-18 20:27:09,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:27:09,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001722168] [2022-11-18 20:27:09,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:27:09,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:09,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:27:09,896 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:27:09,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-11-18 20:27:09,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (60)] Ended with exit code 1 [2022-11-18 20:27:10,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:27:10,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:10,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-18 20:27:10,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:11,116 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-18 20:27:11,387 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 15 treesize of output 11 [2022-11-18 20:27:11,686 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 5 [2022-11-18 20:27:11,764 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2022-11-18 20:27:11,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2022-11-18 20:27:12,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:12,094 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 35 treesize of output 30 [2022-11-18 20:27:12,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:27:12,774 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2022-11-18 20:27:12,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2022-11-18 20:27:13,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:13,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:13,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:13,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2022-11-18 20:27:13,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-11-18 20:27:14,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:14,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 20:27:14,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:14,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:27:14,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:14,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:14,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:14,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2022-11-18 20:27:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:14,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2022-11-18 20:27:14,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:14,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:27:14,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:14,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-18 20:27:14,491 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 11 [2022-11-18 20:27:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-18 20:27:14,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001722168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:17,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:27:17,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 47 [2022-11-18 20:27:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335414797] [2022-11-18 20:27:17,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:27:17,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-18 20:27:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:27:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-18 20:27:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=4123, Unknown=0, NotChecked=0, Total=4422 [2022-11-18 20:27:17,290 INFO L87 Difference]: Start difference. First operand 209 states and 240 transitions. Second operand has 48 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 40 states have internal predecessors, (85), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:27:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:27:21,379 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2022-11-18 20:27:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-18 20:27:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 40 states have internal predecessors, (85), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 99 [2022-11-18 20:27:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:27:21,381 INFO L225 Difference]: With dead ends: 209 [2022-11-18 20:27:21,381 INFO L226 Difference]: Without dead ends: 209 [2022-11-18 20:27:21,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 171 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=396, Invalid=5456, Unknown=0, NotChecked=0, Total=5852 [2022-11-18 20:27:21,382 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:27:21,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 881 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1533 Invalid, 0 Unknown, 247 Unchecked, 3.3s Time] [2022-11-18 20:27:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-18 20:27:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-11-18 20:27:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 183 states have (on average 1.1475409836065573) internal successors, (210), 189 states have internal predecessors, (210), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:27:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2022-11-18 20:27:21,388 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 99 [2022-11-18 20:27:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:27:21,389 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2022-11-18 20:27:21,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 40 states have internal predecessors, (85), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:27:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2022-11-18 20:27:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-18 20:27:21,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:27:21,390 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:27:21,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Ended with exit code 0 [2022-11-18 20:27:21,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:21,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:27:21,806 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:27:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash -339064798, now seen corresponding path program 2 times [2022-11-18 20:27:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:27:21,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707864002] [2022-11-18 20:27:21,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:27:21,807 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-18 20:27:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:27:21,808 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:27:21,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2022-11-18 20:27:22,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:27:22,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:22,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:27:22,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:22,335 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-18 20:27:22,676 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:27:22,676 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-18 20:27:22,790 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 15 treesize of output 11 [2022-11-18 20:27:24,922 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_115| (_ BitVec 32))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_115| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_115|) (_ bv0 32))))) is different from true [2022-11-18 20:27:25,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:25,010 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 24 treesize of output 23 [2022-11-18 20:27:27,079 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_116| (_ BitVec 32))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_116| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_116|) (_ bv0 32))))) is different from true [2022-11-18 20:27:27,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:27,166 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 24 treesize of output 23 [2022-11-18 20:27:29,256 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_117| (_ BitVec 32))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_117| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_117|) (_ bv0 32))))) is different from true [2022-11-18 20:27:29,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:29,468 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 24 treesize of output 23 [2022-11-18 20:27:29,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:29,592 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 24 treesize of output 23 [2022-11-18 20:27:29,750 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 16 treesize of output 8 [2022-11-18 20:27:29,818 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 14 treesize of output 20 [2022-11-18 20:27:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 145 trivial. 30 not checked. [2022-11-18 20:27:29,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:30,348 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 8 treesize of output 6 [2022-11-18 20:27:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 2 proven. 69 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-18 20:27:32,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:27:32,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707864002] [2022-11-18 20:27:32,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707864002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:27:32,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:27:32,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 38 [2022-11-18 20:27:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426615212] [2022-11-18 20:27:32,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:27:32,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-18 20:27:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:27:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-18 20:27:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1144, Unknown=3, NotChecked=210, Total=1482 [2022-11-18 20:27:32,277 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand has 39 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 35 states have internal predecessors, (112), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-18 20:27:47,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:27:49,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:27:52,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:27:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:27:54,754 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2022-11-18 20:27:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-18 20:27:54,756 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 35 states have internal predecessors, (112), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 100 [2022-11-18 20:27:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:27:54,758 INFO L225 Difference]: With dead ends: 230 [2022-11-18 20:27:54,758 INFO L226 Difference]: Without dead ends: 230 [2022-11-18 20:27:54,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=341, Invalid=3088, Unknown=5, NotChecked=348, Total=3782 [2022-11-18 20:27:54,760 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 144 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:27:54,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 612 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 886 Invalid, 3 Unknown, 350 Unchecked, 8.2s Time] [2022-11-18 20:27:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-18 20:27:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 213. [2022-11-18 20:27:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 187 states have (on average 1.1443850267379678) internal successors, (214), 193 states have internal predecessors, (214), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 13 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:27:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 243 transitions. [2022-11-18 20:27:54,765 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 243 transitions. Word has length 100 [2022-11-18 20:27:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:27:54,766 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 243 transitions. [2022-11-18 20:27:54,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 35 states have internal predecessors, (112), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-18 20:27:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 243 transitions. [2022-11-18 20:27:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-18 20:27:54,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:27:54,767 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:27:54,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Forceful destruction successful, exit code 0 [2022-11-18 20:27:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:27:54,975 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:27:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:27:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -636193588, now seen corresponding path program 4 times [2022-11-18 20:27:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:27:54,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368869908] [2022-11-18 20:27:54,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:27:54,975 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-18 20:27:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:27:54,976 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:27:54,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2022-11-18 20:27:55,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:27:55,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:27:55,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 20:27:55,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:27:55,831 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-18 20:27:55,952 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 15 treesize of output 11 [2022-11-18 20:27:56,126 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 5 [2022-11-18 20:27:56,262 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:27:56,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:27:56,513 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 45 treesize of output 35 [2022-11-18 20:27:56,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:27:57,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:57,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 20:27:57,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:27:57,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:27:57,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:27:57,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2022-11-18 20:27:57,456 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 11 [2022-11-18 20:27:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 30 proven. 148 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-18 20:27:57,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:27:58,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:27:58,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368869908] [2022-11-18 20:27:58,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368869908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:27:58,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [364589866] [2022-11-18 20:27:58,489 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:27:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:27:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:27:58,491 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:27:58,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (64)] Waiting until timeout for monitored process [2022-11-18 20:28:01,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:28:01,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:28:01,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-18 20:28:01,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:28:01,383 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-18 20:28:01,419 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 15 treesize of output 11 [2022-11-18 20:28:01,494 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 5 [2022-11-18 20:28:01,580 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:28:01,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:28:01,636 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 45 treesize of output 35 [2022-11-18 20:28:01,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:28:02,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:02,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 20:28:02,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:02,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:28:02,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:28:02,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2022-11-18 20:28:02,180 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 11 [2022-11-18 20:28:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 30 proven. 148 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-18 20:28:02,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:28:02,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [364589866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:28:02,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:28:02,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2022-11-18 20:28:02,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711863602] [2022-11-18 20:28:02,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:28:02,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:28:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:28:02,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:28:02,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2022-11-18 20:28:02,505 INFO L87 Difference]: Start difference. First operand 213 states and 243 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:28:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:28:05,287 INFO L93 Difference]: Finished difference Result 249 states and 279 transitions. [2022-11-18 20:28:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:28:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 102 [2022-11-18 20:28:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:28:05,289 INFO L225 Difference]: With dead ends: 249 [2022-11-18 20:28:05,290 INFO L226 Difference]: Without dead ends: 249 [2022-11-18 20:28:05,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=188, Invalid=2262, Unknown=0, NotChecked=0, Total=2450 [2022-11-18 20:28:05,290 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 78 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:28:05,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 893 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1104 Invalid, 0 Unknown, 150 Unchecked, 1.9s Time] [2022-11-18 20:28:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-18 20:28:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2022-11-18 20:28:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.1359223300970873) internal successors, (234), 212 states have internal predecessors, (234), 11 states have call successors, (11), 7 states have call predecessors, (11), 10 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:28:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 263 transitions. [2022-11-18 20:28:05,296 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 263 transitions. Word has length 102 [2022-11-18 20:28:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:28:05,297 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 263 transitions. [2022-11-18 20:28:05,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:28:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 263 transitions. [2022-11-18 20:28:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-18 20:28:05,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:28:05,298 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:28:05,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Forceful destruction successful, exit code 0 [2022-11-18 20:28:05,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (64)] Forceful destruction successful, exit code 0 [2022-11-18 20:28:05,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:28:05,714 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:28:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash 683730192, now seen corresponding path program 4 times [2022-11-18 20:28:05,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:28:05,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713698380] [2022-11-18 20:28:05,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:28:05,715 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-18 20:28:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:28:05,717 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:28:05,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2022-11-18 20:28:06,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:28:06,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:28:06,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:28:06,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:28:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-18 20:28:06,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:28:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-11-18 20:28:06,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:28:06,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713698380] [2022-11-18 20:28:06,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713698380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:28:06,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:28:06,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-18 20:28:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043030954] [2022-11-18 20:28:06,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:28:06,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:28:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:28:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:28:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:28:06,736 INFO L87 Difference]: Start difference. First operand 234 states and 263 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:28:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:28:07,344 INFO L93 Difference]: Finished difference Result 232 states and 249 transitions. [2022-11-18 20:28:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:28:07,344 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 103 [2022-11-18 20:28:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:28:07,346 INFO L225 Difference]: With dead ends: 232 [2022-11-18 20:28:07,346 INFO L226 Difference]: Without dead ends: 232 [2022-11-18 20:28:07,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:28:07,346 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:28:07,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 659 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:28:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-18 20:28:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2022-11-18 20:28:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 189 states have (on average 1.0952380952380953) internal successors, (207), 195 states have internal predecessors, (207), 11 states have call successors, (11), 7 states have call predecessors, (11), 10 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:28:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 236 transitions. [2022-11-18 20:28:07,367 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 236 transitions. Word has length 103 [2022-11-18 20:28:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:28:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 236 transitions. [2022-11-18 20:28:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:28:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 236 transitions. [2022-11-18 20:28:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-18 20:28:07,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:28:07,369 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:28:07,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Ended with exit code 0 [2022-11-18 20:28:07,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:28:07,583 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:28:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:07,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1238091216, now seen corresponding path program 6 times [2022-11-18 20:28:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:28:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470411949] [2022-11-18 20:28:07,584 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:28:07,584 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-18 20:28:07,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:28:07,585 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:28:07,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (66)] Waiting until timeout for monitored process [2022-11-18 20:28:08,541 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-11-18 20:28:08,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:28:08,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-18 20:28:08,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:28:08,582 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-18 20:28:09,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5078 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5078) |c_#length|)))) is different from true [2022-11-18 20:28:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:09,026 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-18 20:28:09,041 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:09,042 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-18 20:28:09,199 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5079 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5079) |c_#length|)))) is different from true [2022-11-18 20:28:09,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:09,231 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-18 20:28:09,246 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:09,247 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-18 20:28:09,394 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5080 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5080) |c_#length|)))) is different from true [2022-11-18 20:28:09,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:09,411 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-18 20:28:09,422 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:09,422 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-18 20:28:09,585 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5081 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5081))))) is different from true [2022-11-18 20:28:09,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:09,605 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-18 20:28:09,617 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:09,617 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-18 20:28:09,793 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5082 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5082))))) is different from true [2022-11-18 20:28:09,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:09,815 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-18 20:28:09,830 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:09,830 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-18 20:28:10,003 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5083 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5083) |c_#length|)))) is different from true [2022-11-18 20:28:10,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:10,024 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-18 20:28:10,035 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:10,036 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-18 20:28:10,230 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5084 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5084))))) is different from true [2022-11-18 20:28:10,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:10,252 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-18 20:28:10,264 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:10,264 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-18 20:28:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 86 proven. 127 refuted. 0 times theorem prover too weak. 108 trivial. 56 not checked. [2022-11-18 20:28:10,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:28:14,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:28:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470411949] [2022-11-18 20:28:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470411949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:28:14,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [636588110] [2022-11-18 20:28:14,985 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:28:14,985 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:28:14,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:28:14,986 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:28:14,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (67)] Waiting until timeout for monitored process [2022-11-18 20:28:16,862 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-11-18 20:28:16,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:28:16,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-18 20:28:16,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:28:16,918 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-18 20:28:16,923 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-18 20:28:17,418 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5202 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5202) |c_#length|)))) is different from true [2022-11-18 20:28:17,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:17,436 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-18 20:28:17,447 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:17,447 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-18 20:28:17,542 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5203 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5203))))) is different from true [2022-11-18 20:28:17,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:17,560 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-18 20:28:17,571 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:17,572 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-18 20:28:17,764 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2022-11-18 20:28:17,796 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:28:17,796 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 12 treesize of output 18 [2022-11-18 20:28:18,268 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-18 20:28:18,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 43 [2022-11-18 20:28:19,039 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:19,039 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-18 20:28:19,077 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:28:19,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2022-11-18 20:28:19,540 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:19,540 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-18 20:28:19,548 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-18 20:28:19,840 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5211 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5211) |c_#length|)))) is different from true [2022-11-18 20:28:19,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:19,859 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-18 20:28:19,875 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:28:19,875 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-18 20:28:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 15 proven. 149 refuted. 0 times theorem prover too weak. 169 trivial. 44 not checked. [2022-11-18 20:28:19,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:28:22,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [636588110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:28:22,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:28:22,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34] total 49 [2022-11-18 20:28:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836592942] [2022-11-18 20:28:22,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:28:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-18 20:28:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:28:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-18 20:28:22,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1531, Unknown=11, NotChecked=968, Total=2652 [2022-11-18 20:28:22,270 INFO L87 Difference]: Start difference. First operand 217 states and 236 transitions. Second operand has 50 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 44 states have internal predecessors, (101), 11 states have call successors, (11), 3 states have call predecessors, (11), 15 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-18 20:28:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:28:27,085 INFO L93 Difference]: Finished difference Result 303 states and 329 transitions. [2022-11-18 20:28:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-18 20:28:27,086 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 44 states have internal predecessors, (101), 11 states have call successors, (11), 3 states have call predecessors, (11), 15 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) Word has length 110 [2022-11-18 20:28:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:28:27,087 INFO L225 Difference]: With dead ends: 303 [2022-11-18 20:28:27,087 INFO L226 Difference]: Without dead ends: 303 [2022-11-18 20:28:27,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=315, Invalid=3878, Unknown=11, NotChecked=1496, Total=5700 [2022-11-18 20:28:27,087 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 129 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1776 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:28:27,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1625 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1490 Invalid, 0 Unknown, 1776 Unchecked, 2.4s Time] [2022-11-18 20:28:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-18 20:28:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 217. [2022-11-18 20:28:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 189 states have (on average 1.08994708994709) internal successors, (206), 195 states have internal predecessors, (206), 11 states have call successors, (11), 7 states have call predecessors, (11), 10 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:28:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2022-11-18 20:28:27,095 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 110 [2022-11-18 20:28:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:28:27,095 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2022-11-18 20:28:27,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 44 states have internal predecessors, (101), 11 states have call successors, (11), 3 states have call predecessors, (11), 15 states have return successors, (16), 13 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-18 20:28:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2022-11-18 20:28:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-18 20:28:27,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:28:27,097 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:28:27,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (66)] Forceful destruction successful, exit code 0 [2022-11-18 20:28:27,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (67)] Forceful destruction successful, exit code 0 [2022-11-18 20:28:27,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 20:28:27,513 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:28:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:28:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1918735380, now seen corresponding path program 5 times [2022-11-18 20:28:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:28:27,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743307444] [2022-11-18 20:28:27,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:28:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:28:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:28:27,516 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:28:27,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Waiting until timeout for monitored process [2022-11-18 20:28:28,451 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-18 20:28:28,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:28:28,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-18 20:28:28,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:28:28,727 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-18 20:28:28,848 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 15 treesize of output 11 [2022-11-18 20:28:29,012 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 5 [2022-11-18 20:28:29,166 INFO L321 Elim1Store]: treesize reduction 49, result has 38.0 percent of original size [2022-11-18 20:28:29,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 45 [2022-11-18 20:28:29,435 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 45 treesize of output 35 [2022-11-18 20:28:29,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-11-18 20:28:29,967 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2022-11-18 20:28:29,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2022-11-18 20:28:30,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:30,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:30,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:28:30,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2022-11-18 20:28:30,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-11-18 20:28:31,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:31,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 20:28:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:31,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:31,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:28:31,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:28:31,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-18 20:28:31,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:31,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 20:28:31,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:28:31,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:31,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:28:31,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2022-11-18 20:28:32,114 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 11 [2022-11-18 20:28:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 34 proven. 164 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-11-18 20:28:32,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:28:35,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:28:35,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743307444] [2022-11-18 20:28:35,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743307444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:28:35,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [608734391] [2022-11-18 20:28:35,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:28:35,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:28:35,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:28:35,251 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:28:35,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (69)] Waiting until timeout for monitored process [2022-11-18 20:28:40,139 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-18 20:28:40,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:28:40,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-18 20:28:40,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:28:40,313 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-18 20:28:44,593 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_5448 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_5448) |c_#valid|)) (exists ((v_ArrVal_5447 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_5447) |c_#length|)))) is different from true [2022-11-18 20:28:44,655 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:28:44,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:28:44,663 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 14 treesize of output 16 [2022-11-18 20:28:45,264 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:28:45,264 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-18 20:28:45,307 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:28:45,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-18 20:28:45,845 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 15 treesize of output 11 [2022-11-18 20:28:46,497 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 7 treesize of output 5 [2022-11-18 20:28:46,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-18 20:28:55,064 INFO L321 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2022-11-18 20:28:55,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2022-11-18 20:28:55,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:28:55,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:55,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2022-11-18 20:28:56,831 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 7 treesize of output 5 [2022-11-18 20:28:56,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-18 20:28:57,576 INFO L321 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2022-11-18 20:28:57,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2022-11-18 20:28:57,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:28:58,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:58,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:28:58,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2022-11-18 20:29:00,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-18 20:29:00,043 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 7 treesize of output 5 [2022-11-18 20:29:02,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:29:02,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:29:02,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2022-11-18 20:29:03,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:29:03,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:29:03,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:29:03,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 57 [2022-11-18 20:29:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:29:05,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:29:05,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2022-11-18 20:29:05,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:29:05,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2022-11-18 20:29:06,464 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 18 treesize of output 12 [2022-11-18 20:29:06,468 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 27 treesize of output 15 [2022-11-18 20:29:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 25 proven. 237 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2022-11-18 20:29:06,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:14,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [608734391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:14,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:29:14,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 50] total 84 [2022-11-18 20:29:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223906626] [2022-11-18 20:29:14,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:29:14,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-18 20:29:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-18 20:29:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=10229, Unknown=5, NotChecked=204, Total=10920 [2022-11-18 20:29:14,164 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand has 85 states, 84 states have (on average 2.0357142857142856) internal successors, (171), 77 states have internal predecessors, (171), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-18 20:29:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:37,338 INFO L93 Difference]: Finished difference Result 224 states and 243 transitions. [2022-11-18 20:29:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-18 20:29:37,339 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 2.0357142857142856) internal successors, (171), 77 states have internal predecessors, (171), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Word has length 109 [2022-11-18 20:29:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:37,340 INFO L225 Difference]: With dead ends: 224 [2022-11-18 20:29:37,340 INFO L226 Difference]: Without dead ends: 224 [2022-11-18 20:29:37,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4791 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=598, Invalid=12505, Unknown=11, NotChecked=226, Total=13340 [2022-11-18 20:29:37,342 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 76 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 838 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:37,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1298 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1345 Invalid, 0 Unknown, 838 Unchecked, 3.0s Time] [2022-11-18 20:29:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-18 20:29:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-11-18 20:29:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 196 states have (on average 1.0918367346938775) internal successors, (214), 202 states have internal predecessors, (214), 11 states have call successors, (11), 7 states have call predecessors, (11), 10 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-18 20:29:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 243 transitions. [2022-11-18 20:29:37,347 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 243 transitions. Word has length 109 [2022-11-18 20:29:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:37,348 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 243 transitions. [2022-11-18 20:29:37,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 2.0357142857142856) internal successors, (171), 77 states have internal predecessors, (171), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-18 20:29:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 243 transitions. [2022-11-18 20:29:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-18 20:29:37,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:37,349 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:37,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (69)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:37,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:37,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:29:37,763 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-18 20:29:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1206104089, now seen corresponding path program 3 times [2022-11-18 20:29:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:37,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89253539] [2022-11-18 20:29:37,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:29:37,764 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-18 20:29:37,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:37,766 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:29:37,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ab8e1ef-4e93-4fb8-a52a-1416d1af7df1/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (70)] Waiting until timeout for monitored process [2022-11-18 20:29:38,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:29:38,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:38,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-18 20:29:38,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:39,074 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 15 treesize of output 11 [2022-11-18 20:29:39,084 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 15 treesize of output 11 [2022-11-18 20:29:39,543 INFO L321 Elim1Store]: treesize reduction 14, result has 26.3 percent of original size [2022-11-18 20:29:39,544 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 51 treesize of output 43 [2022-11-18 20:29:45,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 73 [2022-11-18 20:29:45,043 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 43 treesize of output 42 [2022-11-18 20:29:45,890 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2022-11-18 20:29:45,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 180 [2022-11-18 20:29:57,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 106 [2022-11-18 20:29:57,044 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 43 treesize of output 42 [2022-11-18 20:29:58,291 INFO L321 Elim1Store]: treesize reduction 126, result has 11.3 percent of original size [2022-11-18 20:29:58,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2949 treesize of output 2841 [2022-11-18 20:30:20,141 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:30:29,676 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:30:38,907 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:30:48,545 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:31:42,729 WARN L233 SmtUtils]: Spent 54.16s on a formula simplification. DAG size of input: 102 DAG size of output: 67 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-18 20:31:42,730 INFO L321 Elim1Store]: treesize reduction 234, result has 42.4 percent of original size [2022-11-18 20:31:42,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 238 treesize of output 305 [2022-11-18 20:31:47,015 INFO L321 Elim1Store]: treesize reduction 52, result has 35.8 percent of original size [2022-11-18 20:31:47,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 90 [2022-11-18 20:32:33,568 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse164 (bvmul |c_ULTIMATE.start_alloc_17_~j~0#1| (_ bv4 32)))) (let ((.cse165 (bvadd |c_ULTIMATE.start_alloc_17_~array#1.offset| (_ bv4294967288 32) .cse164)) (.cse163 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (.cse69 (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse164))) (let ((.cse0 (select .cse163 .cse69)) (.cse68 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (.cse4 (select .cse163 .cse165))) (and (not (= .cse0 (_ bv0 32))) (= |c_ULTIMATE.start_alloc_17_~array#1.offset| |c_ULTIMATE.start_entry_point_~array~0#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)) (let ((.cse14 (bvadd |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse164 (_ bv12 32))) (.cse6 (bvadd (_ bv8 32) |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse164))) (let ((.cse38 (not (= (select .cse163 (bvadd (_ bv4 32) |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse164)) (_ bv0 32)))) (.cse48 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse162 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse160 (bvadd v_prenex_17 .cse162)) (.cse161 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse14 .cse160)) (not (= .cse160 .cse6)) (not (= (_ bv0 32) (select .cse161 (bvadd v_prenex_17 .cse162 (_ bv4294967288 32))))) (not (= (select .cse161 (bvadd v_prenex_17 .cse162 (_ bv4294967284 32))) (_ bv0 32)))))))) (.cse42 (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_ArrVal_5603 (_ BitVec 1)) (v_ArrVal_5575 (_ BitVec 1)) (v_arrayElimCell_408 (_ BitVec 32))) (let ((.cse159 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (let ((.cse158 (store .cse159 .cse4 v_ArrVal_5603))) (let ((.cse157 (store .cse158 .cse0 v_ArrVal_5581))) (and (not (= v_arrayElimCell_408 (_ bv0 32))) (= |c_#valid| (store .cse157 v_arrayElimCell_408 (_ bv0 1))) (= (select .cse158 .cse0) (_ bv0 1)) (= (_ bv0 1) (select .cse157 v_arrayElimCell_408)) (= (_ bv0 1) (select .cse159 .cse4)))))))) (.cse21 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse156 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse155 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse14 (bvadd v_prenex_17 .cse155))) (not (= (_ bv0 32) (select .cse156 (bvadd v_prenex_17 .cse155 (_ bv4294967288 32))))) (not (= (select .cse156 (bvadd v_prenex_17 .cse155 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (.cse96 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse153 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse154 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= (_ bv0 32) (select .cse153 (bvadd v_prenex_17 .cse154 (_ bv4294967288 32))))) (not (= (select .cse153 (bvadd v_prenex_17 .cse154 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (.cse49 (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_ArrVal_5603 (_ BitVec 1)) (v_ArrVal_5575 (_ BitVec 1)) (v_arrayElimCell_408 (_ BitVec 32))) (let ((.cse152 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (let ((.cse151 (store .cse152 .cse4 v_ArrVal_5603))) (let ((.cse150 (store .cse151 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse150 v_arrayElimCell_408 (_ bv0 1))) (= (select .cse151 .cse0) (_ bv0 1)) (= (_ bv0 1) (select .cse150 v_arrayElimCell_408)) (= (_ bv0 1) (select .cse152 .cse4)))))))) (.cse106 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse149 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse148 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= (bvadd v_prenex_17 .cse148) .cse6)) (not (= (_ bv0 32) (select .cse149 (bvadd v_prenex_17 .cse148 (_ bv4294967288 32))))) (not (= (select .cse149 (bvadd v_prenex_17 .cse148 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (.cse20 (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_ArrVal_5603 (_ BitVec 1)) (v_arrayElimCell_404 (_ BitVec 32)) (v_ArrVal_5575 (_ BitVec 1))) (let ((.cse147 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (let ((.cse145 (store .cse147 .cse4 v_ArrVal_5603))) (let ((.cse146 (store .cse145 .cse0 v_ArrVal_5581))) (and (= (select .cse145 .cse0) (_ bv0 1)) (= (store .cse146 v_arrayElimCell_404 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse147 .cse4)) (= (_ bv0 1) (select .cse146 v_arrayElimCell_404))))))))) (or (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse1 (store .cse3 .cse4 v_ArrVal_5603))) (and (= (select .cse1 .cse0) (_ bv0 1)) (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_arrayElimCell_404 (_ BitVec 32))) (let ((.cse2 (store .cse1 .cse0 v_ArrVal_5581))) (and (= (store .cse2 v_arrayElimCell_404 (_ bv0 1)) |c_#valid|) (not (= v_arrayElimCell_404 (_ bv0 32))) (= (_ bv0 1) (select .cse2 v_arrayElimCell_404)))))))) (= (_ bv0 1) (select .cse3 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse11 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse9 (store .cse11 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse5 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= (bvadd v_prenex_17 .cse5) .cse6)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse8 (select .cse10 (bvadd v_prenex_17 .cse5 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse7 (store .cse9 .cse0 v_ArrVal_5581))) (and (= (select .cse7 .cse8) (_ bv0 1)) (= (store .cse7 .cse8 (_ bv0 1)) |c_#valid|)))) (not (= (_ bv0 32) (select .cse10 (bvadd v_prenex_17 .cse5 (_ bv4294967288 32))))) (not (= .cse8 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))))) (= (select .cse9 .cse0) (_ bv0 1))))) (= (_ bv0 1) (select .cse11 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse12 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse12 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse13 (store .cse12 .cse4 v_ArrVal_5603))) (and (= (select .cse13 .cse0) (_ bv0 1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse19 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse15 (bvadd v_prenex_17 .cse19))) (and (not (= .cse14 .cse15)) (not (= .cse15 .cse6)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse18 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse17 (select .cse18 (bvadd v_prenex_17 .cse19 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse16 (store .cse13 .cse0 v_ArrVal_5581))) (and (= (select .cse16 .cse17) (_ bv0 1)) (= (store .cse16 .cse17 (_ bv0 1)) |c_#valid|)))) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse17)) (not (= (_ bv0 32) (select .cse18 (bvadd v_prenex_17 .cse19 (_ bv4294967288 32))))) (not (= .cse17 (_ bv0 32))))))))))))))))) (and .cse20 .cse21) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse27 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse24 (store .cse27 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse25 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse26 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse23 (select .cse25 (bvadd v_prenex_17 .cse26 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse22 (store .cse24 .cse0 v_ArrVal_5581))) (and (= (select .cse22 .cse23) (_ bv0 1)) (= (store .cse22 .cse23 (_ bv0 1)) |c_#valid|)))) (not (= (_ bv0 32) (select .cse25 (bvadd v_prenex_17 .cse26 (_ bv4294967288 32))))) (not (= .cse23 (_ bv0 32))))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))) (= (select .cse24 .cse0) (_ bv0 1))))) (= (_ bv0 1) (select .cse27 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse33 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse28 (store .cse33 .cse4 v_ArrVal_5603))) (and (= (select .cse28 .cse0) (_ bv0 1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse32 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse31 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse29 (store .cse28 .cse0 v_ArrVal_5581)) (.cse30 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (store .cse29 .cse30 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse29 .cse30))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse31 (bvadd v_prenex_17 .cse32 (_ bv4294967288 32))))) (not (= (select .cse31 (bvadd v_prenex_17 .cse32 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))) (not (= .cse14 (bvadd v_prenex_17 .cse32))))))))) (= (_ bv0 1) (select .cse33 .cse4))))) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse36 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse37 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse34 (bvadd v_prenex_17 .cse37)) (.cse35 (select .cse36 (bvadd v_prenex_17 .cse37 (_ bv4294967284 32))))) (and (not (= .cse14 .cse34)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse35) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (not (= .cse34 .cse6)) (not (= (_ bv0 32) (select .cse36 (bvadd v_prenex_17 .cse37 (_ bv4294967288 32))))) (not (= .cse35 (_ bv0 32)))))))) (and .cse20 .cse38) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse41 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse40 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse39 (select .cse41 (bvadd v_prenex_17 .cse40 (_ bv4294967284 32))))) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse39) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (not (= (bvadd v_prenex_17 .cse40) .cse6)) (not (= (_ bv0 32) (select .cse41 (bvadd v_prenex_17 .cse40 (_ bv4294967288 32))))) (not (= .cse39 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (and .cse38 .cse42) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse47 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse43 (store .cse47 .cse4 v_ArrVal_5603))) (and (= (select .cse43 .cse0) (_ bv0 1)) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse45 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse45)))) (and (not (= .cse44 (_ bv0 32))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse45 (_ bv4294967284 32))))) (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse46 (store .cse43 .cse0 v_ArrVal_5581))) (and (= (store .cse46 .cse44 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse46 .cse44)))))))))))) (= (_ bv0 1) (select .cse47 .cse4))))) (and .cse48 .cse49) (and (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse52 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse50 (bvadd v_prenex_17 .cse52)) (.cse51 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse14 .cse50)) (not (= .cse50 .cse6)) (not (= (_ bv0 32) (select .cse51 (bvadd v_prenex_17 .cse52 (_ bv4294967288 32))))) (not (= (select .cse51 (bvadd v_prenex_17 .cse52 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) .cse49) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse53 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse53 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse54 (store .cse53 .cse4 v_ArrVal_5603))) (and (= (select .cse54 .cse0) (_ bv0 1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse59 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse55 (bvadd v_prenex_17 .cse59))) (and (not (= .cse14 .cse55)) (not (= .cse55 .cse6)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse58 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse56 (store .cse54 .cse0 v_ArrVal_5581)) (.cse57 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (store .cse56 .cse57 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse56 .cse57))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse58 (bvadd v_prenex_17 .cse59 (_ bv4294967288 32))))) (not (= (select .cse58 (bvadd v_prenex_17 .cse59 (_ bv4294967284 32))) (_ bv0 32)))))))))))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse67 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse60 (store .cse67 .cse4 v_ArrVal_5603))) (and (= (select .cse60 .cse0) (_ bv0 1)) (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse66 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse61 (bvadd v_prenex_17 .cse66)) (.cse65 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse14 .cse61)) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse64 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (let ((.cse62 (store .cse60 .cse0 v_ArrVal_5581)) (.cse63 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse64)))) (and (= (store .cse62 .cse63 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse62 .cse63))))) (not (= .cse61 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4 32) .cse64)))))) (not (= (_ bv0 32) (select .cse65 (bvadd v_prenex_17 .cse66 (_ bv4294967288 32))))) (not (= (select .cse65 (bvadd v_prenex_17 .cse66 (_ bv4294967284 32))) (_ bv0 32))))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (= (_ bv0 1) (select .cse67 .cse4))))) (and .cse20 .cse48) (and (not (= (select .cse68 .cse69) (_ bv0 32))) .cse42) (and .cse21 .cse49) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse73 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse72 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse70 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|)) (.cse71 (select .cse73 (bvadd v_prenex_17 .cse72 (_ bv4294967284 32))))) (and (not (= (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse70) .cse6)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse70)) .cse71) (not (= (bvadd v_prenex_17 .cse72) .cse6)) (not (= (_ bv0 32) (select .cse73 (bvadd v_prenex_17 .cse72 (_ bv4294967288 32))))) (not (= .cse71 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse74 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse74)) (_ bv0 32))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse74 (_ bv4294967284 32))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse75 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse75 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse76 (store .cse75 .cse4 v_ArrVal_5603))) (and (= (select .cse76 .cse0) (_ bv0 1)) (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse81 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse80 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse79 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (let ((.cse77 (store .cse76 .cse0 v_ArrVal_5581)) (.cse78 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse79)))) (and (= (store .cse77 .cse78 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse77 .cse78))))) (not (= (bvadd v_prenex_17 .cse80) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4 32) .cse79)))))) (not (= (_ bv0 32) (select .cse81 (bvadd v_prenex_17 .cse80 (_ bv4294967288 32))))) (not (= (select .cse81 (bvadd v_prenex_17 .cse80 (_ bv4294967284 32))) (_ bv0 32)))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse89 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse82 (store .cse89 .cse4 v_ArrVal_5603))) (and (= (select .cse82 .cse0) (_ bv0 1)) (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse88 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse83 (bvadd v_prenex_17 .cse88)) (.cse87 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse14 .cse83)) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse86 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (let ((.cse84 (store .cse82 .cse0 v_ArrVal_5581)) (.cse85 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse86)))) (and (= (store .cse84 .cse85 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse84 .cse85))))) (not (= .cse83 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4 32) .cse86)))))) (not (= .cse83 .cse6)) (not (= (_ bv0 32) (select .cse87 (bvadd v_prenex_17 .cse88 (_ bv4294967288 32))))) (not (= (select .cse87 (bvadd v_prenex_17 .cse88 (_ bv4294967284 32))) (_ bv0 32)))))))))) (= (_ bv0 1) (select .cse89 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse95 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse92 (store .cse95 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse93 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse94 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse91 (select .cse93 (bvadd v_prenex_17 .cse94 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse90 (store .cse92 .cse0 v_ArrVal_5581))) (and (= (select .cse90 .cse91) (_ bv0 1)) (= (store .cse90 .cse91 (_ bv0 1)) |c_#valid|)))) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse91)) (not (= (_ bv0 32) (select .cse93 (bvadd v_prenex_17 .cse94 (_ bv4294967288 32))))) (not (= .cse91 (_ bv0 32))))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))) (= (select .cse92 .cse0) (_ bv0 1))))) (= (_ bv0 1) (select .cse95 .cse4))))) (and .cse20 .cse96) (and .cse96 .cse49) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse102 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse97 (store .cse102 .cse4 v_ArrVal_5603))) (and (= (select .cse97 .cse0) (_ bv0 1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse101 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse100 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse98 (store .cse97 .cse0 v_ArrVal_5581)) (.cse99 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (store .cse98 .cse99 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse98 .cse99))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse100 (bvadd v_prenex_17 .cse101 (_ bv4294967288 32))))) (not (= (select .cse100 (bvadd v_prenex_17 .cse101 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))) (not (= (bvadd v_prenex_17 .cse101) .cse6)))))))) (= (_ bv0 1) (select .cse102 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse105 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse103 (store .cse105 .cse4 v_ArrVal_5603))) (and (= (select .cse103 .cse0) (_ bv0 1)) (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_arrayElimCell_408 (_ BitVec 32))) (let ((.cse104 (store .cse103 .cse0 v_ArrVal_5581))) (and (not (= v_arrayElimCell_408 (_ bv0 32))) (= |c_#valid| (store .cse104 v_arrayElimCell_408 (_ bv0 1))) (= (_ bv0 1) (select .cse104 v_arrayElimCell_408)))))))) (= (_ bv0 1) (select .cse105 .cse4))))) (and .cse49 .cse106) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse113 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse107 (store .cse113 .cse4 v_ArrVal_5603))) (and (= (select .cse107 .cse0) (_ bv0 1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse112 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse108 (bvadd v_prenex_17 .cse112))) (and (not (= .cse14 .cse108)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse111 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse110 (select .cse111 (bvadd v_prenex_17 .cse112 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse109 (store .cse107 .cse0 v_ArrVal_5581))) (and (= (select .cse109 .cse110) (_ bv0 1)) (= (store .cse109 .cse110 (_ bv0 1)) |c_#valid|)))) (not (= (_ bv0 32) (select .cse111 (bvadd v_prenex_17 .cse112 (_ bv4294967288 32))))) (not (= .cse110 (_ bv0 32))))))) (not (= .cse108 .cse6))))))))) (= (_ bv0 1) (select .cse113 .cse4))))) (and .cse20 .cse106) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse115 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse116 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse114 (select .cse115 (bvadd v_prenex_17 .cse116 (_ bv4294967284 32))))) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse114) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (not (= (_ bv0 32) (select .cse115 (bvadd v_prenex_17 .cse116 (_ bv4294967288 32))))) (not (= .cse114 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse122 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse117 (store .cse122 .cse4 v_ArrVal_5603))) (and (= (select .cse117 .cse0) (_ bv0 1)) (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse121 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse120 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse118 (store .cse117 .cse0 v_ArrVal_5581)) (.cse119 (select .cse121 (bvadd v_prenex_17 .cse120 (_ bv4294967284 32))))) (and (= (select .cse118 .cse119) (_ bv0 1)) (= (store .cse118 .cse119 (_ bv0 1)) |c_#valid|) (not (= (bvadd v_prenex_17 .cse120) .cse6)) (not (= (_ bv0 32) (select .cse121 (bvadd v_prenex_17 .cse120 (_ bv4294967288 32))))) (not (= .cse119 (_ bv0 32)))))))))) (= (_ bv0 1) (select .cse122 .cse4))))) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse126 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse127 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse124 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|)) (.cse123 (bvadd v_prenex_17 .cse127)) (.cse125 (select .cse126 (bvadd v_prenex_17 .cse127 (_ bv4294967284 32))))) (and (not (= .cse14 .cse123)) (not (= (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse124) .cse6)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse124)) .cse125) (not (= .cse123 .cse6)) (not (= (_ bv0 32) (select .cse126 (bvadd v_prenex_17 .cse127 (_ bv4294967288 32))))) (not (= .cse125 (_ bv0 32)))))))) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse128 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse128)) (_ bv0 32))) (not (= (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse128) .cse6)) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse128 (_ bv4294967284 32))))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse129 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse129 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse132 (store .cse129 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse134 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse133 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse131 (select .cse133 (bvadd v_prenex_17 .cse134 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse130 (store .cse132 .cse0 v_ArrVal_5581))) (and (= (select .cse130 .cse131) (_ bv0 1)) (= (store .cse130 .cse131 (_ bv0 1)) |c_#valid|)))) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse131)) (not (= (_ bv0 32) (select .cse133 (bvadd v_prenex_17 .cse134 (_ bv4294967288 32))))) (not (= .cse131 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (not (= (bvadd v_prenex_17 .cse134) .cse6))))) (= (select .cse132 .cse0) (_ bv0 1)))))))) (and .cse20 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse137 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse138 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse135 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|)) (.cse136 (select .cse137 (bvadd v_prenex_17 .cse138 (_ bv4294967284 32))))) (and (not (= (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse135) .cse6)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse135)) .cse136) (not (= (_ bv0 32) (select .cse137 (bvadd v_prenex_17 .cse138 (_ bv4294967288 32))))) (not (= .cse136 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse144 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse139 (store .cse144 .cse4 v_ArrVal_5603))) (and (= (select .cse139 .cse0) (_ bv0 1)) (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse142 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse143 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse140 (store .cse139 .cse0 v_ArrVal_5581)) (.cse141 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (store .cse140 .cse141 (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse140 .cse141))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse142 (bvadd v_prenex_17 .cse143 (_ bv4294967288 32))))) (not (= (select .cse142 (bvadd v_prenex_17 .cse143 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))))) (= (_ bv0 1) (select .cse144 .cse4)))))))) (or (not (= (select .cse68 .cse165) (_ bv0 32))) (not (= .cse4 (_ bv0 32)))))))) is different from false [2022-11-18 20:32:43,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse152 (bvmul |c_ULTIMATE.start_alloc_17_~j~0#1| (_ bv4 32)))) (let ((.cse165 (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse152)) (.cse151 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (.cse78 (bvadd |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse152))) (let ((.cse0 (select .cse151 .cse78)) (.cse77 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (.cse4 (select .cse151 .cse165))) (and (= |c_ULTIMATE.start_alloc_17_~array#1.offset| |c_ULTIMATE.start_entry_point_~array~0#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv0 1)) (not (= .cse0 (_ bv0 32))) (let ((.cse26 (bvadd (_ bv16 32) |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse152)) (.cse16 (bvadd |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse152 (_ bv12 32)))) (let ((.cse11 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse164 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse163 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse16 (bvadd v_prenex_17 .cse163))) (not (= (_ bv0 32) (select .cse164 (bvadd v_prenex_17 .cse163 (_ bv4294967288 32))))) (not (= (select .cse164 (bvadd v_prenex_17 .cse163 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (.cse20 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse161 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse162 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= (_ bv0 32) (select .cse161 (bvadd v_prenex_17 .cse162 (_ bv4294967288 32))))) (not (= (select .cse161 (bvadd v_prenex_17 .cse162 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (.cse44 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse160 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse159 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse26 (bvadd v_prenex_17 .cse159))) (not (= (_ bv0 32) (select .cse160 (bvadd v_prenex_17 .cse159 (_ bv4294967288 32))))) (not (= (select .cse160 (bvadd v_prenex_17 .cse159 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (.cse21 (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_ArrVal_5603 (_ BitVec 1)) (v_ArrVal_5575 (_ BitVec 1)) (v_arrayElimCell_408 (_ BitVec 32))) (let ((.cse157 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (let ((.cse158 (store .cse157 .cse4 v_ArrVal_5603))) (let ((.cse156 (store .cse158 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse156 v_arrayElimCell_408 (_ bv0 1))) (not (= v_arrayElimCell_408 (_ bv0 32))) (= (_ bv0 1) (select .cse157 .cse4)) (= (_ bv0 1) (select .cse158 .cse0)) (= (_ bv0 1) (select .cse156 v_arrayElimCell_408)))))))) (.cse2 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse155 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse153 (bvadd v_prenex_17 .cse155)) (.cse154 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse26 .cse153)) (not (= .cse16 .cse153)) (not (= (_ bv0 32) (select .cse154 (bvadd v_prenex_17 .cse155 (_ bv4294967288 32))))) (not (= (select .cse154 (bvadd v_prenex_17 .cse155 (_ bv4294967284 32))) (_ bv0 32)))))))) (.cse22 (not (= (select .cse151 (bvadd (_ bv8 32) |c_ULTIMATE.start_alloc_17_~array#1.offset| .cse152)) (_ bv0 32)))) (.cse1 (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_ArrVal_5603 (_ BitVec 1)) (v_ArrVal_5575 (_ BitVec 1)) (v_arrayElimCell_408 (_ BitVec 32))) (let ((.cse149 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (let ((.cse150 (store .cse149 .cse4 v_ArrVal_5603))) (let ((.cse148 (store .cse150 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse148 v_arrayElimCell_408 (_ bv0 1))) (= (_ bv0 1) (select .cse149 .cse4)) (= (_ bv0 1) (select .cse150 .cse0)) (= (_ bv0 1) (select .cse148 v_arrayElimCell_408)))))))) (.cse19 (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_ArrVal_5603 (_ BitVec 1)) (v_arrayElimCell_404 (_ BitVec 32)) (v_ArrVal_5575 (_ BitVec 1))) (let ((.cse145 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (let ((.cse147 (store .cse145 .cse4 v_ArrVal_5603))) (let ((.cse146 (store .cse147 .cse0 v_ArrVal_5581))) (and (= (_ bv0 1) (select .cse145 .cse4)) (= (select .cse146 v_arrayElimCell_404) (_ bv0 1)) (= (_ bv0 1) (select .cse147 .cse0)) (= (store .cse146 v_arrayElimCell_404 (_ bv0 1)) |c_#valid|)))))))) (or (and .cse1 .cse2) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse3 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse9 (store .cse3 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse5 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse6 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= (bvadd v_prenex_17 .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4 32) .cse6))) (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (let ((.cse7 (store .cse9 .cse0 v_ArrVal_5581)) (.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse6)))) (and (= (select .cse7 .cse8) (_ bv0 1)) (= |c_#valid| (store .cse7 .cse8 (_ bv0 1))))))))) (not (= (_ bv0 32) (select .cse10 (bvadd v_prenex_17 .cse5 (_ bv4294967288 32))))) (not (= (select .cse10 (bvadd v_prenex_17 .cse5 (_ bv4294967284 32))) (_ bv0 32)))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))) (= (_ bv0 1) (select .cse9 .cse0)))))))) (and .cse11 .cse1) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse12 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse12 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse13 (store .cse12 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse13 .cse0)) (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse18 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse17 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse14 (store .cse13 .cse0 v_ArrVal_5581)) (.cse15 (select .cse18 (bvadd v_prenex_17 .cse17 (_ bv4294967284 32))))) (and (= |c_#valid| (store .cse14 .cse15 (_ bv0 1))) (not (= .cse16 (bvadd v_prenex_17 .cse17))) (not (= (_ bv0 32) (select .cse18 (bvadd v_prenex_17 .cse17 (_ bv4294967288 32))))) (not (= .cse15 (_ bv0 32))) (= (_ bv0 1) (select .cse14 .cse15)))))))))))) (and .cse19 .cse20) (and .cse21 .cse22) (and (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse24 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse25 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse23 (select .cse24 (bvadd v_prenex_17 .cse25 (_ bv4294967284 32))))) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse23) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (not (= (_ bv0 32) (select .cse24 (bvadd v_prenex_17 .cse25 (_ bv4294967288 32))))) (not (= .cse23 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) .cse19) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse33 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse30 (store .cse33 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse32 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse27 (bvadd v_prenex_17 .cse32))) (and (not (= .cse26 .cse27)) (not (= .cse16 .cse27)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse31 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse28 (store .cse30 .cse0 v_ArrVal_5581)) (.cse29 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (select .cse28 .cse29) (_ bv0 1)) (= |c_#valid| (store .cse28 .cse29 (_ bv0 1)))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse31 (bvadd v_prenex_17 .cse32 (_ bv4294967288 32))))) (not (= (select .cse31 (bvadd v_prenex_17 .cse32 (_ bv4294967284 32))) (_ bv0 32)))))))))) (= (_ bv0 1) (select .cse30 .cse0))))) (= (_ bv0 1) (select .cse33 .cse4))))) (and (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse36 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse34 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse35 (select .cse36 (bvadd v_prenex_17 .cse34 (_ bv4294967284 32))))) (and (not (= .cse16 (bvadd v_prenex_17 .cse34))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse35) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (not (= (_ bv0 32) (select .cse36 (bvadd v_prenex_17 .cse34 (_ bv4294967288 32))))) (not (= .cse35 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) .cse19) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse42 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse39 (store .cse42 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_16 (_ BitVec 32))) (and (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse40 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse41 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse38 (select .cse40 (bvadd v_prenex_17 .cse41 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse37 (store .cse39 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse37 .cse38 (_ bv0 1))) (= (_ bv0 1) (select .cse37 .cse38))))) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse38)) (not (= (_ bv0 32) (select .cse40 (bvadd v_prenex_17 .cse41 (_ bv4294967288 32))))) (not (= .cse38 (_ bv0 32))))))))) (= (_ bv0 1) (select .cse39 .cse0))))) (= (_ bv0 1) (select .cse42 .cse4))))) (and .cse19 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse43 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse43)) (_ bv0 32))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse43 (_ bv4294967284 32))))) (not (= .cse16 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse43))))))) (and .cse19 .cse44) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse45 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse45 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse46 (store .cse45 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse46 .cse0)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse47 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse16 (bvadd v_prenex_17 .cse47))) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse50 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse48 (store .cse46 .cse0 v_ArrVal_5581)) (.cse49 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (select .cse48 .cse49) (_ bv0 1)) (= |c_#valid| (store .cse48 .cse49 (_ bv0 1)))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse50 (bvadd v_prenex_17 .cse47 (_ bv4294967288 32))))) (not (= (select .cse50 (bvadd v_prenex_17 .cse47 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))))))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse57 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse51 (store .cse57 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse51 .cse0)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse56 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse52 (bvadd v_prenex_17 .cse56))) (and (not (= .cse26 .cse52)) (not (= .cse16 .cse52)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse55 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse54 (select .cse55 (bvadd v_prenex_17 .cse56 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse53 (store .cse51 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse53 .cse54 (_ bv0 1))) (= (_ bv0 1) (select .cse53 .cse54))))) (not (= (_ bv0 32) (select .cse55 (bvadd v_prenex_17 .cse56 (_ bv4294967288 32))))) (not (= .cse54 (_ bv0 32)))))))))))))) (= (_ bv0 1) (select .cse57 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse58 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse58 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse59 (store .cse58 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse59 .cse0)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse60 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse16 (bvadd v_prenex_17 .cse60))) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse63 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse62 (select .cse63 (bvadd v_prenex_17 .cse60 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse61 (store .cse59 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse61 .cse62 (_ bv0 1))) (= (_ bv0 1) (select .cse61 .cse62))))) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse62)) (not (= (_ bv0 32) (select .cse63 (bvadd v_prenex_17 .cse60 (_ bv4294967288 32))))) (not (= .cse62 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))))))))))) (and .cse19 .cse11) (and .cse1 .cse20) (and .cse1 .cse44) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse69 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse64 (store .cse69 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse64 .cse0)) (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse67 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse68 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse66 (select .cse67 (bvadd v_prenex_17 .cse68 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse65 (store .cse64 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse65 .cse66 (_ bv0 1))) (= (_ bv0 1) (select .cse65 .cse66))))) (not (= (_ bv0 32) (select .cse67 (bvadd v_prenex_17 .cse68 (_ bv4294967288 32))))) (not (= .cse66 (_ bv0 32))))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (= (_ bv0 1) (select .cse69 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse76 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse70 (store .cse76 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse70 .cse0)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse75 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse71 (bvadd v_prenex_17 .cse75))) (and (not (= .cse26 .cse71)) (not (= .cse16 .cse71)) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse74 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse73 (select .cse74 (bvadd v_prenex_17 .cse75 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse72 (store .cse70 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse72 .cse73 (_ bv0 1))) (= (_ bv0 1) (select .cse72 .cse73))))) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse73)) (not (= (_ bv0 32) (select .cse74 (bvadd v_prenex_17 .cse75 (_ bv4294967288 32))))) (not (= .cse73 (_ bv0 32)))))))))))))) (= (_ bv0 1) (select .cse76 .cse4))))) (and .cse21 (not (= (select .cse77 .cse78) (_ bv0 32)))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse86 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse79 (store .cse86 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse79 .cse0)) (exists ((v_prenex_16 (_ BitVec 32))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse85 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse80 (bvadd v_prenex_17 .cse85)) (.cse84 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse26 .cse80)) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse81 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= .cse80 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4 32) .cse81))) (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (let ((.cse82 (store .cse79 .cse0 v_ArrVal_5581)) (.cse83 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse81)))) (and (= (select .cse82 .cse83) (_ bv0 1)) (= |c_#valid| (store .cse82 .cse83 (_ bv0 1))))))))) (not (= (_ bv0 32) (select .cse84 (bvadd v_prenex_17 .cse85 (_ bv4294967288 32))))) (not (= (select .cse84 (bvadd v_prenex_17 .cse85 (_ bv4294967284 32))) (_ bv0 32))))))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (= (_ bv0 1) (select .cse86 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse87 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse87 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse88 (store .cse87 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse88 .cse0)) (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse91 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse92 (bvmul (_ bv4 32) v_prenex_15))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse89 (store .cse88 .cse0 v_ArrVal_5581)) (.cse90 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (select .cse89 .cse90) (_ bv0 1)) (= |c_#valid| (store .cse89 .cse90 (_ bv0 1)))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse91 (bvadd v_prenex_17 .cse92 (_ bv4294967288 32))))) (not (= (select .cse91 (bvadd v_prenex_17 .cse92 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse97 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse93 (store .cse97 .cse4 v_ArrVal_5603))) (and (= (_ bv0 1) (select .cse93 .cse0)) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse96 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse96)))) (and (not (= .cse94 (_ bv0 32))) (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse95 (store .cse93 .cse0 v_ArrVal_5581))) (and (= (select .cse95 .cse94) (_ bv0 1)) (= |c_#valid| (store .cse95 .cse94 (_ bv0 1)))))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse96 (_ bv4294967284 32)))))))))))) (= (_ bv0 1) (select .cse97 .cse4))))) (and .cse19 .cse2) (and .cse19 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse100 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse101 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse98 (bvadd v_prenex_17 .cse101)) (.cse99 (select .cse100 (bvadd v_prenex_17 .cse101 (_ bv4294967284 32))))) (and (not (= .cse26 .cse98)) (not (= .cse16 .cse98)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) .cse99) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)) (not (= (_ bv0 32) (select .cse100 (bvadd v_prenex_17 .cse101 (_ bv4294967288 32))))) (not (= .cse99 (_ bv0 32)))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse107 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse105 (store .cse107 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse102 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse16 (bvadd v_prenex_17 .cse102))) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse106 (select |c_#memory_$Pointer$.base| v_prenex_16))) (let ((.cse104 (select .cse106 (bvadd v_prenex_17 .cse102 (_ bv4294967284 32))))) (and (exists ((v_ArrVal_5581 (_ BitVec 1))) (let ((.cse103 (store .cse105 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse103 .cse104 (_ bv0 1))) (= (_ bv0 1) (select .cse103 .cse104))))) (not (= (_ bv0 32) (select .cse106 (bvadd v_prenex_17 .cse102 (_ bv4294967288 32))))) (not (= .cse104 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))))) (= (_ bv0 1) (select .cse105 .cse0))))) (= (_ bv0 1) (select .cse107 .cse4))))) (and .cse19 .cse22) (and .cse19 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse111 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse108 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse109 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|)) (.cse110 (select .cse111 (bvadd v_prenex_17 .cse108 (_ bv4294967284 32))))) (and (not (= .cse16 (bvadd v_prenex_17 .cse108))) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse109)) .cse110) (not (= (_ bv0 32) (select .cse111 (bvadd v_prenex_17 .cse108 (_ bv4294967288 32))))) (not (= .cse16 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse109))) (not (= .cse110 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (and .cse19 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse114 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse115 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse112 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|)) (.cse113 (select .cse114 (bvadd v_prenex_17 .cse115 (_ bv4294967284 32))))) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse112)) .cse113) (not (= (_ bv0 32) (select .cse114 (bvadd v_prenex_17 .cse115 (_ bv4294967288 32))))) (not (= .cse16 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse112))) (not (= .cse113 (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (and .cse19 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse116 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse116)) (_ bv0 32))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse116 (_ bv4294967284 32))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| |c_ULTIMATE.start_alloc_17_~array#1.base|)))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse119 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse118 (store .cse119 .cse4 v_ArrVal_5603))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_arrayElimCell_404 (_ BitVec 32))) (let ((.cse117 (store .cse118 .cse0 v_ArrVal_5581))) (and (= (select .cse117 v_arrayElimCell_404) (_ bv0 1)) (= (store .cse117 v_arrayElimCell_404 (_ bv0 1)) |c_#valid|) (not (= v_arrayElimCell_404 (_ bv0 32)))))) (= (_ bv0 1) (select .cse118 .cse0))))) (= (_ bv0 1) (select .cse119 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse120 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (= (_ bv0 1) (select .cse120 .cse4)) (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse124 (store .cse120 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse121 (bvmul (_ bv4 32) v_prenex_15))) (and (not (= .cse26 (bvadd v_prenex_17 .cse121))) (exists ((v_prenex_16 (_ BitVec 32))) (let ((.cse125 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (exists ((|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse122 (store .cse124 .cse0 v_ArrVal_5581)) (.cse123 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))))) (and (= (select .cse122 .cse123) (_ bv0 1)) (= |c_#valid| (store .cse122 .cse123 (_ bv0 1)))))) (not (= |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| v_prenex_16)))) (not (= (_ bv0 32) (select .cse125 (bvadd v_prenex_17 .cse121 (_ bv4294967288 32))))) (not (= (select .cse125 (bvadd v_prenex_17 .cse121 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|)))))))) (= (_ bv0 1) (select .cse124 .cse0)))))))) (and .cse1 (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse128 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse126 (bvadd v_prenex_17 .cse128)) (.cse127 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse26 .cse126)) (not (= .cse16 .cse126)) (not (= (_ bv0 32) (select .cse127 (bvadd v_prenex_17 .cse128 (_ bv4294967288 32))))) (not (= (select .cse127 (bvadd v_prenex_17 .cse128 (_ bv4294967284 32))) (_ bv0 32))) (not (= v_prenex_16 |c_ULTIMATE.start_alloc_17_~array#1.base|))))))) (and .cse19 (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse132 (select |c_#memory_$Pointer$.base| v_prenex_16)) (.cse133 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse129 (bvadd v_prenex_17 .cse133)) (.cse130 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|)) (.cse131 (select .cse132 (bvadd v_prenex_17 .cse133 (_ bv4294967284 32))))) (and (not (= .cse26 .cse129)) (not (= .cse16 .cse129)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse130)) .cse131) (not (= (_ bv0 32) (select .cse132 (bvadd v_prenex_17 .cse133 (_ bv4294967288 32))))) (not (= .cse16 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| .cse130))) (not (= .cse131 (_ bv0 32)))))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse136 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse135 (store .cse136 .cse4 v_ArrVal_5603))) (and (exists ((v_ArrVal_5581 (_ BitVec 1)) (v_arrayElimCell_408 (_ BitVec 32))) (let ((.cse134 (store .cse135 .cse0 v_ArrVal_5581))) (and (= |c_#valid| (store .cse134 v_arrayElimCell_408 (_ bv0 1))) (not (= v_arrayElimCell_408 (_ bv0 32))) (= (_ bv0 1) (select .cse134 v_arrayElimCell_408))))) (= (_ bv0 1) (select .cse135 .cse0))))) (= (_ bv0 1) (select .cse136 .cse4))))) (exists ((v_ArrVal_5575 (_ BitVec 1))) (let ((.cse144 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_entry_point_~array~0#1.base| v_ArrVal_5575))) (and (exists ((v_ArrVal_5603 (_ BitVec 1))) (let ((.cse141 (store .cse144 .cse4 v_ArrVal_5603))) (and (exists ((v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32))) (let ((.cse143 (bvmul (_ bv4 32) v_prenex_15))) (let ((.cse137 (bvadd v_prenex_17 .cse143)) (.cse142 (select |c_#memory_$Pointer$.base| v_prenex_16))) (and (not (= .cse26 .cse137)) (not (= .cse16 .cse137)) (exists ((|v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ BitVec 32))) (let ((.cse138 (bvmul (_ bv4 32) |v_ULTIMATE.start_alloc_17_~i~0#1_BEFORE_CALL_217|))) (and (not (= .cse137 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4 32) .cse138))) (exists ((v_ArrVal_5581 (_ BitVec 1)) (|v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150| (_ BitVec 32))) (let ((.cse139 (store .cse141 .cse0 v_ArrVal_5581)) (.cse140 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_alloc_17_~array#1.base_BEFORE_CALL_150|) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_12| (_ bv4294967288 32) .cse138)))) (and (= (select .cse139 .cse140) (_ bv0 1)) (= |c_#valid| (store .cse139 .cse140 (_ bv0 1))))))))) (not (= (_ bv0 32) (select .cse142 (bvadd v_prenex_17 .cse143 (_ bv4294967288 32))))) (not (= (select .cse142 (bvadd v_prenex_17 .cse143 (_ bv4294967284 32))) (_ bv0 32))))))) (= (_ bv0 1) (select .cse141 .cse0))))) (= (_ bv0 1) (select .cse144 .cse4)))))))) (or (not (= (select .cse77 .cse165) (_ bv0 32))) (not (= .cse4 (_ bv0 32)))))))) is different from false