./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/20020406-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8 --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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- 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-2329fc7 [2022-12-13 16:35:14,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:35:14,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:35:14,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:35:14,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:35:14,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:35:14,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:35:14,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:35:14,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:35:14,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:35:14,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:35:14,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:35:14,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:35:14,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:35:14,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:35:14,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:35:14,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:35:14,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:35:14,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:35:14,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:35:14,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:35:14,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:35:14,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:35:14,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:35:14,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:35:14,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:35:14,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:35:14,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:35:14,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:35:14,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:35:14,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:35:14,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:35:14,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:35:14,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:35:14,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:35:14,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:35:14,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:35:14,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:35:14,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:35:14,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:35:14,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:35:14,314 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:35:14,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:35:14,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:35:14,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:35:14,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:35:14,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:35:14,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:35:14,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:35:14,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:35:14,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:35:14,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:35:14,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:35:14,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:35:14,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:14,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:35:14,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:35:14,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:35:14,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:35:14,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:35:14,340 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:35:14,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:35:14,340 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:35:14,340 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/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_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2022-12-13 16:35:14,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:35:14,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:35:14,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:35:14,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:35:14,548 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:35:14,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/memsafety/20020406-1.i [2022-12-13 16:35:17,206 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:35:17,412 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:35:17,412 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/sv-benchmarks/c/memsafety/20020406-1.i [2022-12-13 16:35:17,426 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data/7b620d75f/f89ac9128b0d4470abd7e29fb2d1dc42/FLAGfd4614fc4 [2022-12-13 16:35:17,438 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data/7b620d75f/f89ac9128b0d4470abd7e29fb2d1dc42 [2022-12-13 16:35:17,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:35:17,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:35:17,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:17,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:35:17,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:35:17,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:17" (1/1) ... [2022-12-13 16:35:17,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6883490e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:17, skipping insertion in model container [2022-12-13 16:35:17,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:17" (1/1) ... [2022-12-13 16:35:17,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:35:17,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:35:17,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:17,830 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-12-13 16:35:17,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79334da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:17, skipping insertion in model container [2022-12-13 16:35:17,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:17,831 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 16:35:17,833 INFO L158 Benchmark]: Toolchain (without parser) took 390.81ms. Allocated memory is still 199.2MB. Free memory was 153.0MB in the beginning and 138.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 16:35:17,833 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory was 52.4MB in the beginning and 52.3MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:35:17,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.66ms. Allocated memory is still 199.2MB. Free memory was 152.7MB in the beginning and 138.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 16:35:17,835 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.16ms. Allocated memory is still 102.8MB. Free memory was 52.4MB in the beginning and 52.3MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.66ms. Allocated memory is still 199.2MB. Free memory was 152.7MB in the beginning and 138.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: 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_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/20020406-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8 --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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- 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-2329fc7 [2022-12-13 16:35:19,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:35:19,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:35:19,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:35:19,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:35:19,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:35:19,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:35:19,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:35:19,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:35:19,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:35:19,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:35:19,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:35:19,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:35:19,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:35:19,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:35:19,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:35:19,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:35:19,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:35:19,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:35:19,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:35:19,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:35:19,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:35:19,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:35:19,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:35:19,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:35:19,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:35:19,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:35:19,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:35:19,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:35:19,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:35:19,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:35:19,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:35:19,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:35:19,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:35:19,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:35:19,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:35:19,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:35:19,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:35:19,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:35:19,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:35:19,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:35:19,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 16:35:19,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:35:19,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:35:19,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:35:19,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:35:19,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:35:19,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:35:19,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:35:19,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:35:19,328 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:35:19,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:35:19,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:35:19,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:35:19,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:35:19,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:35:19,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:35:19,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:19,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:35:19,332 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:35:19,333 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:35:19,333 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/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_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2022-12-13 16:35:19,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:35:19,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:35:19,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:35:19,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:35:19,601 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:35:19,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/memsafety/20020406-1.i [2022-12-13 16:35:22,246 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:35:22,473 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:35:22,474 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/sv-benchmarks/c/memsafety/20020406-1.i [2022-12-13 16:35:22,487 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data/66cba935e/290f7f4bff2349f4985a0e8a7e7ad0fd/FLAGa14abcd29 [2022-12-13 16:35:22,501 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/data/66cba935e/290f7f4bff2349f4985a0e8a7e7ad0fd [2022-12-13 16:35:22,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:35:22,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:35:22,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:22,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:35:22,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:35:22,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:22" (1/1) ... [2022-12-13 16:35:22,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5666c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:22, skipping insertion in model container [2022-12-13 16:35:22,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:35:22" (1/1) ... [2022-12-13 16:35:22,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:35:22,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:35:22,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:22,957 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 16:35:22,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:35:22,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:22,998 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:35:23,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:35:23,067 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:35:23,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23 WrapperNode [2022-12-13 16:35:23,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:35:23,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:35:23,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:35:23,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:35:23,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,111 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-12-13 16:35:23,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:35:23,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:35:23,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:35:23,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:35:23,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,147 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:35:23,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:35:23,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:35:23,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:35:23,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (1/1) ... [2022-12-13 16:35:23,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:35:23,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:35:23,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:35:23,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:35:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2022-12-13 16:35:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2022-12-13 16:35:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 16:35:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:35:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:35:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2022-12-13 16:35:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2022-12-13 16:35:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2022-12-13 16:35:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2022-12-13 16:35:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2022-12-13 16:35:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2022-12-13 16:35:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:35:23,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:35:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:35:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2022-12-13 16:35:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2022-12-13 16:35:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2022-12-13 16:35:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2022-12-13 16:35:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:35:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:35:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:35:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2022-12-13 16:35:23,224 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2022-12-13 16:35:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2022-12-13 16:35:23,224 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2022-12-13 16:35:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:35:23,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:35:23,350 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:35:23,352 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:35:23,943 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:35:23,949 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:35:23,949 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:35:23,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:23 BoogieIcfgContainer [2022-12-13 16:35:23,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:35:23,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:35:23,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:35:23,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:35:23,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:35:22" (1/3) ... [2022-12-13 16:35:23,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc86567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:35:23, skipping insertion in model container [2022-12-13 16:35:23,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:35:23" (2/3) ... [2022-12-13 16:35:23,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc86567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:35:23, skipping insertion in model container [2022-12-13 16:35:23,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:23" (3/3) ... [2022-12-13 16:35:23,957 INFO L112 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2022-12-13 16:35:23,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:35:23,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-12-13 16:35:24,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:35:24,015 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5740beb4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:35:24,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-12-13 16:35:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:35:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 16:35:24,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:24,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:35:24,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:24,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 228226931, now seen corresponding path program 1 times [2022-12-13 16:35:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:24,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832230614] [2022-12-13 16:35:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:24,040 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-12-13 16:35:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:24,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:24,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:24,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:35:24,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:24,199 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-12-13 16:35:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:24,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:24,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:24,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832230614] [2022-12-13 16:35:24,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832230614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:24,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:24,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:35:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863313144] [2022-12-13 16:35:24,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:24,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:35:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:35:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:35:24,250 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:24,539 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2022-12-13 16:35:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:35:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 16:35:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:24,549 INFO L225 Difference]: With dead ends: 182 [2022-12-13 16:35:24,550 INFO L226 Difference]: Without dead ends: 180 [2022-12-13 16:35:24,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:35:24,554 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:24,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 344 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:35:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-13 16:35:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-12-13 16:35:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:35:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2022-12-13 16:35:24,610 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2022-12-13 16:35:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:24,610 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2022-12-13 16:35:24,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2022-12-13 16:35:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 16:35:24,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:24,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:35:24,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:24,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:24,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 228226932, now seen corresponding path program 1 times [2022-12-13 16:35:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:24,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608464950] [2022-12-13 16:35:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:24,817 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-12-13 16:35:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:24,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:24,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:24,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:35:24,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:25,010 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-12-13 16:35:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:25,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:25,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:25,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608464950] [2022-12-13 16:35:25,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608464950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:25,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:25,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:35:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040413955] [2022-12-13 16:35:25,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:25,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:35:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:35:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:35:25,023 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:25,337 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2022-12-13 16:35:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:35:25,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 16:35:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:25,339 INFO L225 Difference]: With dead ends: 184 [2022-12-13 16:35:25,340 INFO L226 Difference]: Without dead ends: 184 [2022-12-13 16:35:25,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:35:25,341 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:25,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:35:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-13 16:35:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-12-13 16:35:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:35:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2022-12-13 16:35:25,353 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2022-12-13 16:35:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:25,353 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2022-12-13 16:35:25,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2022-12-13 16:35:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 16:35:25,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:25,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:25,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:35:25,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:25,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 282747829, now seen corresponding path program 1 times [2022-12-13 16:35:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:25,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172811694] [2022-12-13 16:35:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:25,562 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-12-13 16:35:25,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:25,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:25,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:25,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:35:25,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:25,690 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-12-13 16:35:25,695 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-12-13 16:35:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:35:25,737 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-12-13 16:35:25,747 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:35:25,747 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-12-13 16:35:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:25,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:25,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:25,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172811694] [2022-12-13 16:35:25,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172811694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:25,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:25,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:35:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678484200] [2022-12-13 16:35:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:25,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:35:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:25,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:35:25,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:35:25,768 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:26,029 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2022-12-13 16:35:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:35:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 16:35:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:26,031 INFO L225 Difference]: With dead ends: 177 [2022-12-13 16:35:26,031 INFO L226 Difference]: Without dead ends: 177 [2022-12-13 16:35:26,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:35:26,033 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:26,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 342 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:35:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-12-13 16:35:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2022-12-13 16:35:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:35:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-12-13 16:35:26,046 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2022-12-13 16:35:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:26,046 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-12-13 16:35:26,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-12-13 16:35:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 16:35:26,047 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:26,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:26,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:35:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:26,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1865414411, now seen corresponding path program 1 times [2022-12-13 16:35:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:26,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315137551] [2022-12-13 16:35:26,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:26,253 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-12-13 16:35:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:26,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:26,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:26,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:35:26,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:26,399 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-12-13 16:35:26,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:35:26,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 16:35:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:26,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:26,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315137551] [2022-12-13 16:35:26,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315137551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:26,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:26,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152722776] [2022-12-13 16:35:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:26,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:26,456 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:27,024 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2022-12-13 16:35:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:35:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 16:35:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:27,026 INFO L225 Difference]: With dead ends: 186 [2022-12-13 16:35:27,026 INFO L226 Difference]: Without dead ends: 186 [2022-12-13 16:35:27,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:35:27,028 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:27,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 811 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:35:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-12-13 16:35:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2022-12-13 16:35:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:35:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2022-12-13 16:35:27,043 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2022-12-13 16:35:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:27,044 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2022-12-13 16:35:27,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2022-12-13 16:35:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 16:35:27,045 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:27,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:27,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 16:35:27,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:27,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271845, now seen corresponding path program 1 times [2022-12-13 16:35:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:27,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150474389] [2022-12-13 16:35:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:27,249 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-12-13 16:35:27,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:27,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:27,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:27,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 16:35:27,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:27,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 10 treesize of output 9 [2022-12-13 16:35:27,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:35:27,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:35:27,478 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 25 treesize of output 13 [2022-12-13 16:35:27,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 16:35:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:27,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:27,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:27,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150474389] [2022-12-13 16:35:27,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150474389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:27,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:27,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:35:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429868780] [2022-12-13 16:35:27,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:27,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:35:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:27,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:35:27,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:35:27,542 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:28,340 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2022-12-13 16:35:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:35:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 16:35:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:28,341 INFO L225 Difference]: With dead ends: 197 [2022-12-13 16:35:28,341 INFO L226 Difference]: Without dead ends: 197 [2022-12-13 16:35:28,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:35:28,342 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 62 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:28,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1053 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 16:35:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-13 16:35:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2022-12-13 16:35:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:35:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2022-12-13 16:35:28,348 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2022-12-13 16:35:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:28,348 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2022-12-13 16:35:28,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:35:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2022-12-13 16:35:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 16:35:28,349 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:28,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:28,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:35:28,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:28,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:28,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash 335042805, now seen corresponding path program 1 times [2022-12-13 16:35:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:28,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270084874] [2022-12-13 16:35:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:28,551 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-12-13 16:35:28,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:28,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:28,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:28,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:35:28,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:28,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:28,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:28,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270084874] [2022-12-13 16:35:28,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270084874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:28,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:28,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:35:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511986462] [2022-12-13 16:35:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:28,713 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-12-13 16:35:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:28,942 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2022-12-13 16:35:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:35:28,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 21 [2022-12-13 16:35:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:28,944 INFO L225 Difference]: With dead ends: 209 [2022-12-13 16:35:28,944 INFO L226 Difference]: Without dead ends: 203 [2022-12-13 16:35:28,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:35:28,945 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 44 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:28,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 757 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:35:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-13 16:35:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2022-12-13 16:35:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 156 states have internal predecessors, (164), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-12-13 16:35:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2022-12-13 16:35:28,954 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 21 [2022-12-13 16:35:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:28,954 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2022-12-13 16:35:28,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-12-13 16:35:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2022-12-13 16:35:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 16:35:28,955 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:28,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:28,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-12-13 16:35:29,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:29,156 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:29,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash 370721495, now seen corresponding path program 1 times [2022-12-13 16:35:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:29,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336754461] [2022-12-13 16:35:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:29,160 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-12-13 16:35:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:29,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:29,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:29,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:35:29,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:29,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:35:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:29,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:29,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336754461] [2022-12-13 16:35:29,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336754461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:35:29,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:35:29,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-12-13 16:35:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173803438] [2022-12-13 16:35:29,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:35:29,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:35:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:35:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:35:29,639 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:35:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:30,256 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2022-12-13 16:35:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:35:30,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-13 16:35:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:30,258 INFO L225 Difference]: With dead ends: 246 [2022-12-13 16:35:30,258 INFO L226 Difference]: Without dead ends: 234 [2022-12-13 16:35:30,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2022-12-13 16:35:30,259 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 123 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1351 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:35:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-12-13 16:35:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2022-12-13 16:35:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 127 states have (on average 1.4960629921259843) internal successors, (190), 173 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-12-13 16:35:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2022-12-13 16:35:30,265 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 22 [2022-12-13 16:35:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:30,265 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2022-12-13 16:35:30,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:35:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2022-12-13 16:35:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 16:35:30,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:30,266 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:30,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 16:35:30,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:30,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -843792011, now seen corresponding path program 2 times [2022-12-13 16:35:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:30,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980957046] [2022-12-13 16:35:30,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:35:30,468 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-12-13 16:35:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:30,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:30,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:30,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:35:30,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:35:30,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:35:30,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 16:35:30,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:30,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980957046] [2022-12-13 16:35:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980957046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:30,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:35:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112116299] [2022-12-13 16:35:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:35:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:30,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:35:30,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:35:30,613 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:35:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:31,117 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2022-12-13 16:35:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:35:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-12-13 16:35:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:31,120 INFO L225 Difference]: With dead ends: 214 [2022-12-13 16:35:31,120 INFO L226 Difference]: Without dead ends: 214 [2022-12-13 16:35:31,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:35:31,121 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:31,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 756 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:35:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-12-13 16:35:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-12-13 16:35:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-12-13 16:35:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-12-13 16:35:31,129 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 25 [2022-12-13 16:35:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:31,130 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-12-13 16:35:31,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:35:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-12-13 16:35:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 16:35:31,130 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:31,131 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:31,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:35:31,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:31,332 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash -843792010, now seen corresponding path program 1 times [2022-12-13 16:35:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:31,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630148796] [2022-12-13 16:35:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:31,336 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-12-13 16:35:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:31,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:31,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:31,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:35:31,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:31,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:35:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:35:32,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:32,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630148796] [2022-12-13 16:35:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630148796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:35:32,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:35:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-12-13 16:35:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198300491] [2022-12-13 16:35:32,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:35:32,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 16:35:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 16:35:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:35:32,133 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:35:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:33,524 INFO L93 Difference]: Finished difference Result 285 states and 358 transitions. [2022-12-13 16:35:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 16:35:33,525 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-13 16:35:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:33,526 INFO L225 Difference]: With dead ends: 285 [2022-12-13 16:35:33,526 INFO L226 Difference]: Without dead ends: 267 [2022-12-13 16:35:33,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 16:35:33,527 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 165 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:33,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1817 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 16:35:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-12-13 16:35:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 222. [2022-12-13 16:35:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 179 states have internal predecessors, (193), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-12-13 16:35:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2022-12-13 16:35:33,534 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 25 [2022-12-13 16:35:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:33,534 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2022-12-13 16:35:33,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:35:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2022-12-13 16:35:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 16:35:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:33,534 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:33,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 16:35:33,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:33,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash 168356342, now seen corresponding path program 2 times [2022-12-13 16:35:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:33,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737717492] [2022-12-13 16:35:33,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:35:33,739 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-12-13 16:35:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:33,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:33,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:33,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:35:33,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:35:33,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:35:33,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 16:35:33,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:35:33,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:33,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737717492] [2022-12-13 16:35:33,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737717492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:35:33,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:35:33,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:35:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958807290] [2022-12-13 16:35:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:35:33,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:35:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:33,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:35:33,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:35:33,969 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:35:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:34,419 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2022-12-13 16:35:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:35:34,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-12-13 16:35:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:34,421 INFO L225 Difference]: With dead ends: 220 [2022-12-13 16:35:34,421 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 16:35:34,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:35:34,422 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:34,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 809 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:35:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 16:35:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-12-13 16:35:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 177 states have internal predecessors, (191), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-12-13 16:35:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2022-12-13 16:35:34,426 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 29 [2022-12-13 16:35:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:34,427 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2022-12-13 16:35:34,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:35:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2022-12-13 16:35:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 16:35:34,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:34,427 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:34,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:35:34,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:34,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash 924079462, now seen corresponding path program 1 times [2022-12-13 16:35:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:34,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689364853] [2022-12-13 16:35:34,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:34,633 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-12-13 16:35:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:34,636 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:34,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 16:35:34,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:34,885 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-12-13 16:35:34,903 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:35:34,903 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-12-13 16:35:34,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:35:35,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,112 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,140 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,163 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:35:35,245 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:35,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 16:35:35,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-12-13 16:35:35,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-13 16:35:35,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-12-13 16:35:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 16:35:35,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:35:38,683 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 16:35:38,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 16:35:38,748 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 16:35:38,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:35:38,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-13 16:35:38,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-12-13 16:35:38,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 16:35:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 8 not checked. [2022-12-13 16:35:42,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:35:42,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689364853] [2022-12-13 16:35:42,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689364853] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:35:42,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:35:42,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-12-13 16:35:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148219006] [2022-12-13 16:35:42,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:35:42,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 16:35:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:35:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 16:35:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=256, Unknown=4, NotChecked=102, Total=420 [2022-12-13 16:35:42,877 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:35:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:35:44,817 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2022-12-13 16:35:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:35:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 16:35:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:35:44,819 INFO L225 Difference]: With dead ends: 219 [2022-12-13 16:35:44,819 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 16:35:44,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=99, Invalid=415, Unknown=4, NotChecked=132, Total=650 [2022-12-13 16:35:44,820 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 25 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:35:44,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2130 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 760 Invalid, 0 Unknown, 215 Unchecked, 1.6s Time] [2022-12-13 16:35:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 16:35:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-12-13 16:35:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 176 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-12-13 16:35:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2022-12-13 16:35:44,829 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 30 [2022-12-13 16:35:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:35:44,829 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2022-12-13 16:35:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:35:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2022-12-13 16:35:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 16:35:44,830 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:35:44,831 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:35:44,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 16:35:45,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:45,032 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:35:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:35:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash 924079463, now seen corresponding path program 1 times [2022-12-13 16:35:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:35:45,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377159623] [2022-12-13 16:35:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:35:45,034 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-12-13 16:35:45,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:35:45,035 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:45,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:35:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:35:45,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 16:35:45,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:35:45,290 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-12-13 16:35:45,310 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 10 treesize of output 9 [2022-12-13 16:35:45,324 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:35:45,324 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-12-13 16:35:45,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:35:45,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:35:45,542 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:35:45,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:35:45,550 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 3 [2022-12-13 16:35:45,570 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,620 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:35:45,639 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 16 treesize of output 18 [2022-12-13 16:35:45,664 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:35:45,684 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 16 treesize of output 18 [2022-12-13 16:35:45,708 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:35:45,727 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 16 treesize of output 18 [2022-12-13 16:35:45,754 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:35:45,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:35:45,761 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 3 [2022-12-13 16:35:45,779 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,828 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:35:45,846 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 16 treesize of output 18 [2022-12-13 16:35:45,870 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:35:45,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:35:45,888 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 16 treesize of output 18 [2022-12-13 16:35:45,911 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:35:45,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-12-13 16:35:45,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 16:35:45,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-12-13 16:35:45,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-13 16:35:45,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-12-13 16:35:45,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-12-13 16:35:46,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-12-13 16:35:46,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 16:35:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 16:35:46,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:36:20,501 WARN L233 SmtUtils]: Spent 34.12s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 16:36:29,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:36:29,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-12-13 16:36:29,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-12-13 16:36:29,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:36:29,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-13 16:36:29,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:36:29,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-13 16:36:29,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:36:29,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-12-13 16:36:29,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:36:29,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 16:36:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 16:36:30,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377159623] [2022-12-13 16:36:30,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377159623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:36:30,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:36:30,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-12-13 16:36:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691690893] [2022-12-13 16:36:30,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:36:30,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 16:36:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:30,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 16:36:30,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=361, Unknown=4, NotChecked=0, Total=420 [2022-12-13 16:36:30,085 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:36:37,782 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 115 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:36:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:36:46,128 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2022-12-13 16:36:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 16:36:46,129 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 16:36:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:36:46,130 INFO L225 Difference]: With dead ends: 218 [2022-12-13 16:36:46,130 INFO L226 Difference]: Without dead ends: 218 [2022-12-13 16:36:46,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=169, Invalid=883, Unknown=4, NotChecked=0, Total=1056 [2022-12-13 16:36:46,130 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 40 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 17 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:36:46,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2225 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1079 Invalid, 5 Unknown, 0 Unchecked, 6.9s Time] [2022-12-13 16:36:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-13 16:36:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-12-13 16:36:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 175 states have internal predecessors, (189), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2022-12-13 16:36:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2022-12-13 16:36:46,134 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 30 [2022-12-13 16:36:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:36:46,135 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2022-12-13 16:36:46,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:36:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2022-12-13 16:36:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 16:36:46,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:36:46,135 INFO L195 NwaCegarLoop]: trace histogram [8, 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] [2022-12-13 16:36:46,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:36:46,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:46,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:36:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2092985884, now seen corresponding path program 1 times [2022-12-13 16:36:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:46,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051930410] [2022-12-13 16:36:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:36:46,340 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-12-13 16:36:46,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:46,344 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:46,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 16:36:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:36:46,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 16:36:46,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:46,625 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 10 treesize of output 9 [2022-12-13 16:36:46,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:36:46,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:36:46,710 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 25 treesize of output 13 [2022-12-13 16:36:46,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 16:36:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 16:36:46,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:36:46,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:46,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051930410] [2022-12-13 16:36:46,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051930410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:36:46,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:36:46,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:36:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189715243] [2022-12-13 16:36:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:36:46,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:36:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:36:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:36:46,775 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:36:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:36:47,562 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2022-12-13 16:36:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:36:47,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-12-13 16:36:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:36:47,564 INFO L225 Difference]: With dead ends: 230 [2022-12-13 16:36:47,564 INFO L226 Difference]: Without dead ends: 218 [2022-12-13 16:36:47,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:36:47,564 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 62 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:36:47,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 902 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:36:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-13 16:36:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2022-12-13 16:36:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.376923076923077) internal successors, (179), 170 states have internal predecessors, (179), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:36:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2022-12-13 16:36:47,570 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2022-12-13 16:36:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:36:47,571 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2022-12-13 16:36:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:36:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2022-12-13 16:36:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 16:36:47,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:36:47,571 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:47,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 16:36:47,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:47,773 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:36:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -562772518, now seen corresponding path program 1 times [2022-12-13 16:36:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:47,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601456143] [2022-12-13 16:36:47,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:36:47,777 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-12-13 16:36:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:47,781 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:47,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:36:48,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:36:48,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:36:48,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:36:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:36:48,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:48,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601456143] [2022-12-13 16:36:48,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601456143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:36:48,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:36:48,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-12-13 16:36:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989855733] [2022-12-13 16:36:48,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:36:48,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 16:36:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:48,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 16:36:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-13 16:36:48,815 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:36:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:36:51,017 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2022-12-13 16:36:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 16:36:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2022-12-13 16:36:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:36:51,018 INFO L225 Difference]: With dead ends: 291 [2022-12-13 16:36:51,019 INFO L226 Difference]: Without dead ends: 279 [2022-12-13 16:36:51,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=641, Invalid=1521, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 16:36:51,019 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 180 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:36:51,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2371 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 16:36:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-13 16:36:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 220. [2022-12-13 16:36:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 177 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:36:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2022-12-13 16:36:51,025 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 56 [2022-12-13 16:36:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:36:51,025 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2022-12-13 16:36:51,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:36:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2022-12-13 16:36:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 16:36:51,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:36:51,026 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:51,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:51,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:51,227 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:36:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093162, now seen corresponding path program 2 times [2022-12-13 16:36:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:51,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811803938] [2022-12-13 16:36:51,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:36:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:36:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:51,228 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:51,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:51,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:36:51,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:36:51,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:36:51,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-12-13 16:36:51,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:36:51,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:51,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811803938] [2022-12-13 16:36:51,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811803938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:36:51,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:36:51,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:36:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146155026] [2022-12-13 16:36:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:36:51,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:36:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:51,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:36:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:36:51,400 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-12-13 16:36:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:36:51,913 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2022-12-13 16:36:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:36:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 63 [2022-12-13 16:36:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:36:51,914 INFO L225 Difference]: With dead ends: 218 [2022-12-13 16:36:51,914 INFO L226 Difference]: Without dead ends: 218 [2022-12-13 16:36:51,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:36:51,915 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 23 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:36:51,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:36:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-12-13 16:36:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-12-13 16:36:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 175 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:36:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2022-12-13 16:36:51,919 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 63 [2022-12-13 16:36:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:36:51,919 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2022-12-13 16:36:51,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-12-13 16:36:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2022-12-13 16:36:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 16:36:51,920 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:36:51,920 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:51,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:52,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:36:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093161, now seen corresponding path program 1 times [2022-12-13 16:36:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:52,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825331037] [2022-12-13 16:36:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:36:52,125 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-12-13 16:36:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:52,128 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:52,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:36:52,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:36:52,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-13 16:36:52,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:36:52,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:36:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825331037] [2022-12-13 16:36:52,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825331037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:36:52,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:36:52,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:36:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765766816] [2022-12-13 16:36:52,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:36:52,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:36:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:36:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:36:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:36:52,664 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-12-13 16:36:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:36:53,183 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2022-12-13 16:36:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:36:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 63 [2022-12-13 16:36:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:36:53,185 INFO L225 Difference]: With dead ends: 216 [2022-12-13 16:36:53,185 INFO L226 Difference]: Without dead ends: 216 [2022-12-13 16:36:53,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:36:53,185 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 16 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:36:53,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 787 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:36:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-13 16:36:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-12-13 16:36:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 173 states have internal predecessors, (182), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:36:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2022-12-13 16:36:53,189 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 63 [2022-12-13 16:36:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:36:53,189 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2022-12-13 16:36:53,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-12-13 16:36:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2022-12-13 16:36:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 16:36:53,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:36:53,190 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:36:53,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:36:53,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:53,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:36:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:36:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash -585378383, now seen corresponding path program 1 times [2022-12-13 16:36:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:36:53,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277311555] [2022-12-13 16:36:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:36:53,391 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-12-13 16:36:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:36:53,392 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:53,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:36:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:36:54,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 16:36:54,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:36:54,111 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-12-13 16:36:54,151 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:36:54,151 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-12-13 16:36:54,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:36:54,350 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,381 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,447 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,481 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,512 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,542 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,572 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,602 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,627 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,656 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:36:54,685 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:36:54,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 16:36:54,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:36:54,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:36:54,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:36:54,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:36:54,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-12-13 16:36:54,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-13 16:36:54,845 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-12-13 16:36:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 16:36:54,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:37:00,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-13 16:37:02,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:37:02,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-13 16:37:02,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-12-13 16:37:02,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 16:37:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 16:37:04,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:37:04,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277311555] [2022-12-13 16:37:04,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277311555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:37:04,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:37:04,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-12-13 16:37:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015350528] [2022-12-13 16:37:04,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:37:04,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 16:37:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:37:04,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 16:37:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=319, Unknown=3, NotChecked=36, Total=420 [2022-12-13 16:37:04,481 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:37:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:37:06,762 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2022-12-13 16:37:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:37:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-12-13 16:37:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:37:06,763 INFO L225 Difference]: With dead ends: 220 [2022-12-13 16:37:06,763 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 16:37:06,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=98, Invalid=455, Unknown=3, NotChecked=44, Total=600 [2022-12-13 16:37:06,764 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 32 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:37:06,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1951 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 770 Invalid, 0 Unknown, 67 Unchecked, 2.1s Time] [2022-12-13 16:37:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 16:37:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2022-12-13 16:37:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 172 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:37:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2022-12-13 16:37:06,768 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 64 [2022-12-13 16:37:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:37:06,768 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2022-12-13 16:37:06,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:37:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2022-12-13 16:37:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 16:37:06,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:37:06,769 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:37:06,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:37:06,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:37:06,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:37:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:37:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash -585378382, now seen corresponding path program 1 times [2022-12-13 16:37:06,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:37:06,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373740214] [2022-12-13 16:37:06,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:37:06,970 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-12-13 16:37:06,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:37:06,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:37:06,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:37:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:37:07,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 16:37:07,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:37:07,647 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-12-13 16:37:07,675 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 10 treesize of output 9 [2022-12-13 16:37:07,693 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:37:07,694 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-12-13 16:37:07,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:37:07,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:37:07,966 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:07,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:07,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:07,987 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 16 treesize of output 18 [2022-12-13 16:37:08,020 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:37:08,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:37:08,028 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 3 [2022-12-13 16:37:08,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,140 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 16 treesize of output 18 [2022-12-13 16:37:08,173 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:37:08,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:37:08,181 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 3 [2022-12-13 16:37:08,203 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,266 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,293 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 16 treesize of output 18 [2022-12-13 16:37:08,323 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:37:08,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:37:08,330 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 3 [2022-12-13 16:37:08,348 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,406 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:37:08,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:37:08,412 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 3 [2022-12-13 16:37:08,431 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,488 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,511 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 16 treesize of output 18 [2022-12-13 16:37:08,538 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:37:08,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:37:08,542 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 3 [2022-12-13 16:37:08,567 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,623 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:37:08,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:37:08,630 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 3 [2022-12-13 16:37:08,651 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,715 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:37:08,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,751 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 16 treesize of output 18 [2022-12-13 16:37:08,778 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:37:08,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-12-13 16:37:08,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 16:37:08,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-12-13 16:37:08,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:37:08,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-13 16:37:08,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-12-13 16:37:08,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-12-13 16:37:09,088 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 25 treesize of output 13 [2022-12-13 16:37:09,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 16:37:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 16:37:09,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:38:05,795 WARN L233 SmtUtils]: Spent 56.38s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 16:38:14,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:38:14,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-12-13 16:38:14,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-12-13 16:38:14,241 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 7 [2022-12-13 16:38:14,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:38:14,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-13 16:38:14,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:38:14,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-13 16:38:14,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:38:14,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-12-13 16:38:14,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:38:14,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-13 16:38:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 16:38:14,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:38:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373740214] [2022-12-13 16:38:14,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373740214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:38:14,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:38:14,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-12-13 16:38:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199415172] [2022-12-13 16:38:14,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:38:14,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 16:38:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:38:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 16:38:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=361, Unknown=4, NotChecked=0, Total=420 [2022-12-13 16:38:14,574 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:38:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:38:26,440 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-12-13 16:38:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 16:38:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-12-13 16:38:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:38:26,443 INFO L225 Difference]: With dead ends: 219 [2022-12-13 16:38:26,443 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 16:38:26,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=169, Invalid=883, Unknown=4, NotChecked=0, Total=1056 [2022-12-13 16:38:26,444 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 52 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:38:26,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 2299 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1055 Invalid, 5 Unknown, 0 Unchecked, 6.8s Time] [2022-12-13 16:38:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 16:38:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2022-12-13 16:38:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.313868613138686) internal successors, (180), 171 states have internal predecessors, (180), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-13 16:38:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-12-13 16:38:26,450 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 64 [2022-12-13 16:38:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:38:26,450 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-12-13 16:38:26,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:38:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-12-13 16:38:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 16:38:26,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:38:26,451 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-13 16:38:26,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-12-13 16:38:26,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:38:26,652 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:38:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:38:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741073, now seen corresponding path program 1 times [2022-12-13 16:38:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:38:26,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113633465] [2022-12-13 16:38:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:38:26,656 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-12-13 16:38:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:38:26,658 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:38:26,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:38:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:38:27,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 16:38:27,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:38:27,256 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-12-13 16:38:27,359 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649))) is different from true [2022-12-13 16:38:27,368 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~malloc33#1.base| (_ bv1 1)))) is different from true [2022-12-13 16:38:27,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:38:27,382 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|)) (_ bv1 1)) |c_#valid|)) is different from true [2022-12-13 16:38:27,391 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 25 treesize of output 13 [2022-12-13 16:38:27,397 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~mem34#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2022-12-13 16:38:27,405 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2022-12-13 16:38:27,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:38:27,567 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-12-13 16:38:27,567 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 2 case distinctions, treesize of input 17 treesize of output 31 [2022-12-13 16:38:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 123 not checked. [2022-12-13 16:38:27,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:38:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-13 16:38:28,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:38:28,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113633465] [2022-12-13 16:38:28,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113633465] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:38:28,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:38:28,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 19 [2022-12-13 16:38:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395077873] [2022-12-13 16:38:28,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:38:28,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 16:38:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:38:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 16:38:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=179, Unknown=5, NotChecked=150, Total=380 [2022-12-13 16:38:28,361 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:38:34,612 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 [0, 1] [2022-12-13 16:38:36,636 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 [0, 1] [2022-12-13 16:38:38,639 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 [0, 1] [2022-12-13 16:38:40,648 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 [0, 1] [2022-12-13 16:38:42,650 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 [0, 1] [2022-12-13 16:38:44,685 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 [0, 1] [2022-12-13 16:38:46,687 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 [0, 1] [2022-12-13 16:38:48,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 16:38:51,192 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 [0, 1] [2022-12-13 16:38:53,311 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 [0, 1] [2022-12-13 16:38:55,339 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 [0, 1] [2022-12-13 16:38:57,341 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 [0, 1] [2022-12-13 16:38:59,445 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 [0, 1] [2022-12-13 16:39:01,460 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 [0, 1] [2022-12-13 16:39:03,472 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 [0, 1] [2022-12-13 16:39:05,473 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 [0, 1] [2022-12-13 16:39:07,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 16:39:09,747 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 [0, 1] [2022-12-13 16:39:11,792 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 [0, 1] [2022-12-13 16:39:13,800 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 [0, 1] [2022-12-13 16:39:15,807 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 [0, 1] [2022-12-13 16:39:17,815 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 [0, 1] [2022-12-13 16:39:19,818 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 [0, 1] [2022-12-13 16:39:21,820 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 [0, 1] [2022-12-13 16:39:24,036 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 [0, 1] [2022-12-13 16:39:26,076 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 [0, 1] [2022-12-13 16:39:28,923 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 [0, 1] [2022-12-13 16:39:30,946 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 [0, 1] [2022-12-13 16:39:32,949 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 [0, 1] [2022-12-13 16:39:35,000 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 [0, 1] [2022-12-13 16:39:37,026 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 [0, 1] [2022-12-13 16:39:39,029 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 [0, 1] [2022-12-13 16:39:41,141 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 [0, 1] [2022-12-13 16:39:43,173 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 [0, 1] [2022-12-13 16:39:45,176 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 [0, 1] [2022-12-13 16:39:47,281 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 [0, 1] [2022-12-13 16:39:49,306 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 [0, 1] [2022-12-13 16:39:51,308 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 [0, 1] [2022-12-13 16:39:53,412 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 [0, 1] [2022-12-13 16:39:55,450 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 [0, 1] [2022-12-13 16:39:57,453 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 [0, 1] [2022-12-13 16:39:59,689 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 [0, 1] [2022-12-13 16:40:01,692 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 [0, 1] [2022-12-13 16:40:03,733 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 [0, 1] [2022-12-13 16:40:05,735 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 [0, 1] [2022-12-13 16:40:07,900 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 [0, 1] [2022-12-13 16:40:09,902 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 [0, 1] [2022-12-13 16:40:11,924 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 [0, 1] [2022-12-13 16:40:13,926 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 [0, 1] [2022-12-13 16:40:15,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 16:40:17,970 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 [0, 1] [2022-12-13 16:40:19,987 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 [0, 1] [2022-12-13 16:40:21,989 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 [0, 1] [2022-12-13 16:40:24,049 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 [0, 1] [2022-12-13 16:40:26,083 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 [0, 1] [2022-12-13 16:40:28,181 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 [0, 1] [2022-12-13 16:40:30,195 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 [0, 1] [2022-12-13 16:40:32,203 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 [0, 1] [2022-12-13 16:40:34,217 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 [0, 1] [2022-12-13 16:40:36,219 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 [0, 1] [2022-12-13 16:40:38,221 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 [0, 1] [2022-12-13 16:40:40,499 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 [0, 1] [2022-12-13 16:40:42,523 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 [0, 1] [2022-12-13 16:40:44,525 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 [0, 1] [2022-12-13 16:40:46,540 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 [0, 1] [2022-12-13 16:40:48,573 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 [0, 1] [2022-12-13 16:40:50,714 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 [0, 1] [2022-12-13 16:40:52,742 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 [0, 1] [2022-12-13 16:40:54,744 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 [0, 1] [2022-12-13 16:40:56,835 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 [0, 1] [2022-12-13 16:40:58,861 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 [0, 1] [2022-12-13 16:41:00,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 [0, 1] [2022-12-13 16:41:02,904 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 [0, 1] [2022-12-13 16:41:04,919 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 [0, 1] [2022-12-13 16:41:06,927 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 [0, 1] [2022-12-13 16:41:08,930 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 [0, 1] [2022-12-13 16:41:10,965 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 [0, 1] [2022-12-13 16:41:12,968 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 [0, 1] [2022-12-13 16:41:14,986 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 [0, 1] [2022-12-13 16:41:16,989 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 [0, 1] [2022-12-13 16:41:18,991 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 [0, 1] [2022-12-13 16:41:21,017 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 [0, 1] [2022-12-13 16:41:23,055 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 [0, 1] [2022-12-13 16:41:25,057 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 [0, 1] [2022-12-13 16:41:27,113 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 [0, 1] [2022-12-13 16:41:29,145 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 [0, 1] [2022-12-13 16:41:31,147 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 [0, 1] [2022-12-13 16:41:33,253 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 [0, 1] [2022-12-13 16:41:35,287 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 [0, 1] [2022-12-13 16:41:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:41:35,287 INFO L93 Difference]: Finished difference Result 336 states and 413 transitions. [2022-12-13 16:41:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 16:41:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2022-12-13 16:41:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:41:35,290 INFO L225 Difference]: With dead ends: 336 [2022-12-13 16:41:35,290 INFO L226 Difference]: Without dead ends: 336 [2022-12-13 16:41:35,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=859, Unknown=5, NotChecked=330, Total=1406 [2022-12-13 16:41:35,290 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 680 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 386 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 185.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 1307 IncrementalHoareTripleChecker+Unchecked, 186.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:41:35,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 612 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1456 Invalid, 90 Unknown, 1307 Unchecked, 186.0s Time] [2022-12-13 16:41:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-12-13 16:41:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 296. [2022-12-13 16:41:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 185 states have (on average 1.427027027027027) internal successors, (264), 222 states have internal predecessors, (264), 67 states have call successors, (67), 12 states have call predecessors, (67), 12 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-12-13 16:41:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 398 transitions. [2022-12-13 16:41:35,300 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 398 transitions. Word has length 71 [2022-12-13 16:41:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:41:35,300 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 398 transitions. [2022-12-13 16:41:35,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:41:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 398 transitions. [2022-12-13 16:41:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 16:41:35,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:41:35,301 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-13 16:41:35,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:41:35,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:41:35,502 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:41:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:41:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741072, now seen corresponding path program 1 times [2022-12-13 16:41:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:41:35,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016186833] [2022-12-13 16:41:35,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:41:35,506 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-12-13 16:41:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:41:35,509 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:41:35,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-13 16:41:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:41:36,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 16:41:36,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:41:36,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:41:36,558 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 29 treesize of output 17 [2022-12-13 16:41:36,571 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_~ans~0#1.base| (_ BitVec 32)) (v_ArrVal_2939 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2939) |c_DUPFFnew_#t~mem34#1.base| (bvadd (_ bv4 32) (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32))))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2022-12-13 16:41:36,587 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32)) (v_ArrVal_2939 (_ BitVec 32))) (and (= (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2939) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (bvadd (_ bv4 32) (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)))) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2022-12-13 16:41:36,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:41:36,822 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 16:41:36,823 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 2 case distinctions, treesize of input 17 treesize of output 29 [2022-12-13 16:41:36,835 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:41:36,835 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-12-13 16:41:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 114 trivial. 126 not checked. [2022-12-13 16:41:37,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:41:44,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:41:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016186833] [2022-12-13 16:41:44,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016186833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:41:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1649269262] [2022-12-13 16:41:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:41:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 16:41:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 16:41:44,156 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 16:41:44,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-12-13 16:41:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:41:45,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 16:41:45,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:41:45,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-12-13 16:41:45,776 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-12-13 16:41:45,873 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:41:45,873 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-12-13 16:41:45,889 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:41:45,889 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-12-13 16:41:46,373 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#t~malloc33#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32)) (v_ArrVal_2939 (_ BitVec 32))) (and (= (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2939) |DUPFFnew_#t~malloc33#1.base| (bvadd (_ bv4 32) (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)))) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2022-12-13 16:41:46,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:41:46,617 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 16:41:46,617 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 16:41:46,634 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:41:46,634 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-12-13 16:41:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 128 not checked. [2022-12-13 16:41:46,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:41:47,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1649269262] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:41:47,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:41:47,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2022-12-13 16:41:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599517832] [2022-12-13 16:41:47,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:41:47,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 16:41:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:41:47,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 16:41:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1026, Unknown=4, NotChecked=198, Total=1332 [2022-12-13 16:41:47,468 INFO L87 Difference]: Start difference. First operand 296 states and 398 transitions. Second operand has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 16:41:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:41:58,080 INFO L93 Difference]: Finished difference Result 399 states and 543 transitions. [2022-12-13 16:41:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 16:41:58,081 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2022-12-13 16:41:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:41:58,082 INFO L225 Difference]: With dead ends: 399 [2022-12-13 16:41:58,082 INFO L226 Difference]: Without dead ends: 399 [2022-12-13 16:41:58,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=227, Invalid=2037, Unknown=4, NotChecked=282, Total=2550 [2022-12-13 16:41:58,083 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 361 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 173 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 4703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 847 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-12-13 16:41:58,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1669 Invalid, 4703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 3681 Invalid, 2 Unknown, 847 Unchecked, 8.7s Time] [2022-12-13 16:41:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-12-13 16:41:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 301. [2022-12-13 16:41:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 226 states have internal predecessors, (267), 67 states have call successors, (67), 13 states have call predecessors, (67), 13 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-12-13 16:41:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 401 transitions. [2022-12-13 16:41:58,094 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 401 transitions. Word has length 71 [2022-12-13 16:41:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:41:58,094 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 401 transitions. [2022-12-13 16:41:58,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 16:41:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-12-13 16:41:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 16:41:58,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:41:58,094 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 16:41:58,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2022-12-13 16:41:58,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-12-13 16:41:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:41:58,496 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:41:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:41:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash -242190254, now seen corresponding path program 1 times [2022-12-13 16:41:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:41:58,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771900795] [2022-12-13 16:41:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:41:58,500 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-12-13 16:41:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:41:58,501 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:41:58,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-13 16:41:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:41:59,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 16:41:59,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:41:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-12-13 16:41:59,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:41:59,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:41:59,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771900795] [2022-12-13 16:41:59,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771900795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:41:59,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:41:59,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:41:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398058521] [2022-12-13 16:41:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:41:59,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 16:41:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:41:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 16:41:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:41:59,184 INFO L87 Difference]: Start difference. First operand 301 states and 401 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:42:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:01,043 INFO L93 Difference]: Finished difference Result 312 states and 409 transitions. [2022-12-13 16:42:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:42:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-12-13 16:42:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:01,047 INFO L225 Difference]: With dead ends: 312 [2022-12-13 16:42:01,047 INFO L226 Difference]: Without dead ends: 312 [2022-12-13 16:42:01,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:42:01,048 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:01,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 749 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-13 16:42:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-13 16:42:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2022-12-13 16:42:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 230 states have internal predecessors, (272), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-12-13 16:42:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2022-12-13 16:42:01,053 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 77 [2022-12-13 16:42:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:01,053 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2022-12-13 16:42:01,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:42:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2022-12-13 16:42:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 16:42:01,054 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:01,054 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 16:42:01,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:42:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:01,255 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -242190253, now seen corresponding path program 1 times [2022-12-13 16:42:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:01,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439352255] [2022-12-13 16:42:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:42:01,258 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-12-13 16:42:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:01,261 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:01,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:42:01,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 16:42:01,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-13 16:42:02,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:42:02,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439352255] [2022-12-13 16:42:02,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439352255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:42:02,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:42:02,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 16:42:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357700925] [2022-12-13 16:42:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:42:02,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:42:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:42:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:42:02,161 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:42:04,220 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 [0] [2022-12-13 16:42:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:06,496 INFO L93 Difference]: Finished difference Result 313 states and 409 transitions. [2022-12-13 16:42:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:42:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2022-12-13 16:42:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:06,499 INFO L225 Difference]: With dead ends: 313 [2022-12-13 16:42:06,499 INFO L226 Difference]: Without dead ends: 313 [2022-12-13 16:42:06,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:42:06,499 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 255 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:06,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 915 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1123 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-12-13 16:42:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-12-13 16:42:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 306. [2022-12-13 16:42:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 193 states have (on average 1.4041450777202074) internal successors, (271), 230 states have internal predecessors, (271), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-12-13 16:42:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 405 transitions. [2022-12-13 16:42:06,505 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 405 transitions. Word has length 77 [2022-12-13 16:42:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:06,507 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 405 transitions. [2022-12-13 16:42:06,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:42:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 405 transitions. [2022-12-13 16:42:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 16:42:06,508 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:06,508 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-12-13 16:42:06,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:06,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:06,709 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953710, now seen corresponding path program 1 times [2022-12-13 16:42:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:06,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078105569] [2022-12-13 16:42:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:42:06,713 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-12-13 16:42:06,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:06,715 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:06,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:42:07,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 16:42:07,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-12-13 16:42:07,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:42:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-12-13 16:42:07,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:07,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078105569] [2022-12-13 16:42:07,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078105569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:42:07,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:42:07,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2022-12-13 16:42:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394776754] [2022-12-13 16:42:07,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:42:07,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 16:42:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:07,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 16:42:07,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:42:07,625 INFO L87 Difference]: Start difference. First operand 306 states and 405 transitions. Second operand has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 16:42:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:10,053 INFO L93 Difference]: Finished difference Result 361 states and 475 transitions. [2022-12-13 16:42:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:42:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-12-13 16:42:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:10,055 INFO L225 Difference]: With dead ends: 361 [2022-12-13 16:42:10,055 INFO L226 Difference]: Without dead ends: 361 [2022-12-13 16:42:10,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:42:10,056 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 293 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:10,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1015 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-13 16:42:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-12-13 16:42:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 344. [2022-12-13 16:42:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 218 states have (on average 1.3944954128440368) internal successors, (304), 258 states have internal predecessors, (304), 74 states have call successors, (74), 17 states have call predecessors, (74), 20 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-12-13 16:42:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 458 transitions. [2022-12-13 16:42:10,062 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 458 transitions. Word has length 86 [2022-12-13 16:42:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:10,063 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 458 transitions. [2022-12-13 16:42:10,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 16:42:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 458 transitions. [2022-12-13 16:42:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 16:42:10,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:10,064 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-12-13 16:42:10,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:42:10,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:10,265 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953709, now seen corresponding path program 1 times [2022-12-13 16:42:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:10,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971395308] [2022-12-13 16:42:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:42:10,268 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-12-13 16:42:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:10,271 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:10,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:42:10,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 16:42:10,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-13 16:42:11,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:42:12,618 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 20 [2022-12-13 16:42:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-13 16:42:12,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:12,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971395308] [2022-12-13 16:42:12,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971395308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:42:12,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:42:12,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-12-13 16:42:12,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142025792] [2022-12-13 16:42:12,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:42:12,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 16:42:12,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 16:42:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-12-13 16:42:12,793 INFO L87 Difference]: Start difference. First operand 344 states and 458 transitions. Second operand has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:42:14,987 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 [0] [2022-12-13 16:42:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:21,138 INFO L93 Difference]: Finished difference Result 366 states and 478 transitions. [2022-12-13 16:42:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:42:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2022-12-13 16:42:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:21,140 INFO L225 Difference]: With dead ends: 366 [2022-12-13 16:42:21,140 INFO L226 Difference]: Without dead ends: 366 [2022-12-13 16:42:21,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2022-12-13 16:42:21,141 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 348 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 110 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:21,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1329 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1690 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2022-12-13 16:42:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-13 16:42:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 349. [2022-12-13 16:42:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 222 states have (on average 1.3783783783783783) internal successors, (306), 262 states have internal predecessors, (306), 74 states have call successors, (74), 18 states have call predecessors, (74), 21 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-12-13 16:42:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 460 transitions. [2022-12-13 16:42:21,149 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 460 transitions. Word has length 86 [2022-12-13 16:42:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:21,149 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 460 transitions. [2022-12-13 16:42:21,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:42:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 460 transitions. [2022-12-13 16:42:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 16:42:21,150 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:21,150 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-13 16:42:21,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:42:21,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:21,351 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 194820021, now seen corresponding path program 2 times [2022-12-13 16:42:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:21,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409283776] [2022-12-13 16:42:21,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:42:21,355 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-12-13 16:42:21,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:21,356 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:21,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:21,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:42:21,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:42:21,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:42:21,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-12-13 16:42:22,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:42:22,171 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 16:42:22,171 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-12-13 16:42:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-12-13 16:42:22,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:22,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409283776] [2022-12-13 16:42:22,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409283776] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:42:22,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:42:22,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2022-12-13 16:42:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933246787] [2022-12-13 16:42:22,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:42:22,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:42:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:42:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:42:22,184 INFO L87 Difference]: Start difference. First operand 349 states and 460 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:42:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:23,595 INFO L93 Difference]: Finished difference Result 364 states and 473 transitions. [2022-12-13 16:42:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:42:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-12-13 16:42:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:23,597 INFO L225 Difference]: With dead ends: 364 [2022-12-13 16:42:23,597 INFO L226 Difference]: Without dead ends: 364 [2022-12-13 16:42:23,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:42:23,598 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 228 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:23,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 673 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 16:42:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-12-13 16:42:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 350. [2022-12-13 16:42:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 224 states have (on average 1.375) internal successors, (308), 262 states have internal predecessors, (308), 74 states have call successors, (74), 19 states have call predecessors, (74), 21 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-12-13 16:42:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2022-12-13 16:42:23,603 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 92 [2022-12-13 16:42:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:23,604 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2022-12-13 16:42:23,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:42:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2022-12-13 16:42:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 16:42:23,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:23,605 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-12-13 16:42:23,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-12-13 16:42:23,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:23,805 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 194820022, now seen corresponding path program 2 times [2022-12-13 16:42:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:23,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867060336] [2022-12-13 16:42:23,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:42:23,806 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-12-13 16:42:23,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:23,807 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:23,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:24,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:42:24,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:42:24,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 16:42:24,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 143 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-12-13 16:42:25,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:42:25,562 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-12-13 16:42:25,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:42:25,782 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 20 [2022-12-13 16:42:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 143 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-12-13 16:42:26,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:26,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867060336] [2022-12-13 16:42:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867060336] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:42:26,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:42:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-12-13 16:42:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399432694] [2022-12-13 16:42:26,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:42:26,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 16:42:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 16:42:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2022-12-13 16:42:26,625 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-13 16:42:28,900 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 [0] [2022-12-13 16:42:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:40,411 INFO L93 Difference]: Finished difference Result 454 states and 586 transitions. [2022-12-13 16:42:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 16:42:40,413 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 92 [2022-12-13 16:42:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:40,414 INFO L225 Difference]: With dead ends: 454 [2022-12-13 16:42:40,414 INFO L226 Difference]: Without dead ends: 454 [2022-12-13 16:42:40,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=264, Invalid=2088, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 16:42:40,415 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 863 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 436 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:40,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1947 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 2452 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2022-12-13 16:42:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-12-13 16:42:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2022-12-13 16:42:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 257 states have (on average 1.4280155642023347) internal successors, (367), 296 states have internal predecessors, (367), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-12-13 16:42:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2022-12-13 16:42:40,423 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 565 transitions. Word has length 92 [2022-12-13 16:42:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 565 transitions. [2022-12-13 16:42:40,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-13 16:42:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 565 transitions. [2022-12-13 16:42:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 16:42:40,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:40,424 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:42:40,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:42:40,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:40,625 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -947573994, now seen corresponding path program 1 times [2022-12-13 16:42:40,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:40,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776529824] [2022-12-13 16:42:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:42:40,626 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-12-13 16:42:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:40,627 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:40,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:42:41,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:42:41,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-12-13 16:42:41,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:42:41,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:41,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776529824] [2022-12-13 16:42:41,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776529824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:42:41,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:42:41,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:42:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718791244] [2022-12-13 16:42:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:42:41,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:42:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:42:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:42:41,194 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 16:42:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:41,201 INFO L93 Difference]: Finished difference Result 410 states and 565 transitions. [2022-12-13 16:42:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:42:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-12-13 16:42:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:41,203 INFO L225 Difference]: With dead ends: 410 [2022-12-13 16:42:41,203 INFO L226 Difference]: Without dead ends: 407 [2022-12-13 16:42:41,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:42:41,203 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:41,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:42:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-12-13 16:42:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-12-13 16:42:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 257 states have (on average 1.416342412451362) internal successors, (364), 296 states have internal predecessors, (364), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-12-13 16:42:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 562 transitions. [2022-12-13 16:42:41,211 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 562 transitions. Word has length 92 [2022-12-13 16:42:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:41,212 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 562 transitions. [2022-12-13 16:42:41,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 16:42:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 562 transitions. [2022-12-13 16:42:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:42:41,212 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:41,212 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 16:42:41,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:41,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:41,413 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883697, now seen corresponding path program 3 times [2022-12-13 16:42:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:41,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129427754] [2022-12-13 16:42:41,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:42:41,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-12-13 16:42:41,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:41,418 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:41,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:42,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 16:42:42,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:42:42,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:42:42,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-12-13 16:42:42,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:42:42,438 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-13 16:42:42,439 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-12-13 16:42:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2022-12-13 16:42:42,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:42,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129427754] [2022-12-13 16:42:42,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129427754] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:42:42,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:42:42,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-12-13 16:42:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168104770] [2022-12-13 16:42:42,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:42:42,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:42:42,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:42,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:42:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:42:42,456 INFO L87 Difference]: Start difference. First operand 407 states and 562 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 16:42:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:43,480 INFO L93 Difference]: Finished difference Result 433 states and 588 transitions. [2022-12-13 16:42:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:42:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 101 [2022-12-13 16:42:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:43,481 INFO L225 Difference]: With dead ends: 433 [2022-12-13 16:42:43,481 INFO L226 Difference]: Without dead ends: 433 [2022-12-13 16:42:43,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:42:43,482 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 79 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:43,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 976 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 16:42:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-13 16:42:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 409. [2022-12-13 16:42:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 259 states have (on average 1.416988416988417) internal successors, (367), 297 states have internal predecessors, (367), 99 states have call successors, (99), 21 states have call predecessors, (99), 20 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-12-13 16:42:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 565 transitions. [2022-12-13 16:42:43,488 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 565 transitions. Word has length 101 [2022-12-13 16:42:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:43,489 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 565 transitions. [2022-12-13 16:42:43,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 16:42:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 565 transitions. [2022-12-13 16:42:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:42:43,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:43,489 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 16:42:43,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:43,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:43,690 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883696, now seen corresponding path program 3 times [2022-12-13 16:42:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:43,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315177850] [2022-12-13 16:42:43,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:42:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:42:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:43,694 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:43,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-12-13 16:42:44,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 16:42:44,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:42:44,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 16:42:44,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-12-13 16:42:45,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:42:45,599 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-12-13 16:42:45,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:42:45,828 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 20 [2022-12-13 16:42:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-12-13 16:42:46,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:42:46,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315177850] [2022-12-13 16:42:46,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315177850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:42:46,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:42:46,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2022-12-13 16:42:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051121465] [2022-12-13 16:42:46,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:42:46,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 16:42:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:42:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 16:42:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-12-13 16:42:46,946 INFO L87 Difference]: Start difference. First operand 409 states and 565 transitions. Second operand has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-13 16:42:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:42:58,626 INFO L93 Difference]: Finished difference Result 488 states and 591 transitions. [2022-12-13 16:42:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 16:42:58,627 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 101 [2022-12-13 16:42:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:42:58,630 INFO L225 Difference]: With dead ends: 488 [2022-12-13 16:42:58,630 INFO L226 Difference]: Without dead ends: 488 [2022-12-13 16:42:58,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=283, Invalid=2167, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 16:42:58,632 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 927 mSDsluCounter, 5657 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 6074 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-12-13 16:42:58,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 6074 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-12-13 16:42:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-12-13 16:42:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 417. [2022-12-13 16:42:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 265 states have (on average 1.4037735849056603) internal successors, (372), 304 states have internal predecessors, (372), 99 states have call successors, (99), 22 states have call predecessors, (99), 22 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-12-13 16:42:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 570 transitions. [2022-12-13 16:42:58,638 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 570 transitions. Word has length 101 [2022-12-13 16:42:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:42:58,639 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 570 transitions. [2022-12-13 16:42:58,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-13 16:42:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 570 transitions. [2022-12-13 16:42:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 16:42:58,639 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:42:58,639 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:42:58,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:42:58,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:58,840 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:42:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:42:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2143025534, now seen corresponding path program 1 times [2022-12-13 16:42:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:42:58,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389375750] [2022-12-13 16:42:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:42:58,841 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-12-13 16:42:58,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:42:58,841 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:58,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:42:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:42:59,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 16:42:59,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:42:59,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-12-13 16:43:00,187 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 16:43:00,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 18 [2022-12-13 16:43:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-12-13 16:43:00,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:43:00,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:43:00,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389375750] [2022-12-13 16:43:00,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389375750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:43:00,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:43:00,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 16:43:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782293180] [2022-12-13 16:43:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:43:00,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 16:43:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:43:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 16:43:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:43:00,254 INFO L87 Difference]: Start difference. First operand 417 states and 570 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 16:43:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:43:02,041 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2022-12-13 16:43:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:43:02,042 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 99 [2022-12-13 16:43:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:43:02,043 INFO L225 Difference]: With dead ends: 375 [2022-12-13 16:43:02,043 INFO L226 Difference]: Without dead ends: 364 [2022-12-13 16:43:02,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-12-13 16:43:02,044 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:43:02,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1819 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 16:43:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-12-13 16:43:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2022-12-13 16:43:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 253 states have internal predecessors, (291), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-12-13 16:43:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 431 transitions. [2022-12-13 16:43:02,053 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 431 transitions. Word has length 99 [2022-12-13 16:43:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:43:02,054 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 431 transitions. [2022-12-13 16:43:02,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 16:43:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 431 transitions. [2022-12-13 16:43:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-13 16:43:02,055 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:43:02,055 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:43:02,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:43:02,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:02,256 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:43:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:43:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash 783105185, now seen corresponding path program 1 times [2022-12-13 16:43:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:43:02,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809500822] [2022-12-13 16:43:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:43:02,260 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-12-13 16:43:02,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:43:02,263 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:02,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:43:03,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 16:43:03,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:43:03,636 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-12-13 16:43:03,677 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 16:43:03,677 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-12-13 16:43:03,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:43:03,864 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:03,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:03,897 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:03,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:03,935 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:03,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:03,965 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:03,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:03,996 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:03,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,058 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,089 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,123 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,156 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 16:43:04,227 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-13 16:43:04,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2022-12-13 16:43:04,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-13 16:43:04,517 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:04,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-13 16:43:04,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:04,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2022-12-13 16:43:05,710 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-12-13 16:43:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-12-13 16:43:05,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:43:08,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse0) v_ArrVal_6321) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0)))))) is different from false [2022-12-13 16:43:08,246 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0) v_ArrVal_6321) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 16:43:12,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_#res#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_#res#1.base|) .cse0) v_ArrVal_6321) |c_DUPFFnew_#res#1.base|) .cse0)))))) is different from false [2022-12-13 16:43:12,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_6321) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-13 16:43:14,569 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6319 (_ BitVec 32)) (v_ArrVal_6318 (_ BitVec 32)) (v_ArrVal_6317 (_ BitVec 32)) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6316 (_ BitVec 32))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base| (store (store (store (store .cse0 (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6319) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6318) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6317) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6316)) (select .cse0 .cse1) v_ArrVal_6321)) |c_DUPFFnew_~ans~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 16:43:17,090 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6314 (_ BitVec 32)) (v_ArrVal_6313 (_ BitVec 32)) (v_ArrVal_6312 (_ BitVec 32)) (v_ArrVal_6311 (_ BitVec 32)) (v_ArrVal_6319 (_ BitVec 32)) (v_ArrVal_6318 (_ BitVec 32)) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6317 (_ BitVec 32)) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6316 (_ BitVec 32))) (= (bvadd (select |c_#valid| (let ((.cse2 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_6310))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store (store (store (store (store .cse1 |c_DUPFFnew_~ans~0#1.offset| v_ArrVal_6314) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv1 32)) v_ArrVal_6313) (bvadd (_ bv2 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6312) (bvadd (_ bv3 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6311) (bvadd (_ bv4 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6319) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6318) (bvadd (_ bv6 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6317) (bvadd (_ bv7 32) |c_DUPFFnew_~ans~0#1.offset|) v_ArrVal_6316)) (select .cse1 .cse2) v_ArrVal_6321))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-13 16:43:19,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:43:19,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 85 [2022-12-13 16:43:19,307 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 106 treesize of output 82 [2022-12-13 16:43:19,314 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 44 treesize of output 32 [2022-12-13 16:43:19,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-12-13 16:43:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-12-13 16:43:21,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:43:21,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809500822] [2022-12-13 16:43:21,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809500822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:43:21,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:43:21,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2022-12-13 16:43:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122449078] [2022-12-13 16:43:21,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:43:21,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 16:43:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:43:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 16:43:21,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=716, Unknown=12, NotChecked=354, Total=1190 [2022-12-13 16:43:21,593 INFO L87 Difference]: Start difference. First operand 338 states and 431 transitions. Second operand has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 16:43:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:43:27,515 INFO L93 Difference]: Finished difference Result 397 states and 514 transitions. [2022-12-13 16:43:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 16:43:27,516 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-12-13 16:43:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:43:27,517 INFO L225 Difference]: With dead ends: 397 [2022-12-13 16:43:27,517 INFO L226 Difference]: Without dead ends: 397 [2022-12-13 16:43:27,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 183 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=185, Invalid=1159, Unknown=12, NotChecked=450, Total=1806 [2022-12-13 16:43:27,518 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 184 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 3376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1095 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:43:27,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 3049 Invalid, 3376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2207 Invalid, 0 Unknown, 1095 Unchecked, 5.2s Time] [2022-12-13 16:43:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-12-13 16:43:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 338. [2022-12-13 16:43:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 217 states have (on average 1.336405529953917) internal successors, (290), 253 states have internal predecessors, (290), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-12-13 16:43:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 430 transitions. [2022-12-13 16:43:27,524 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 430 transitions. Word has length 114 [2022-12-13 16:43:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:43:27,524 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 430 transitions. [2022-12-13 16:43:27,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 29 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 16:43:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-12-13 16:43:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-13 16:43:27,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:43:27,525 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:43:27,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:27,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:27,725 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:43:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:43:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash 783105186, now seen corresponding path program 1 times [2022-12-13 16:43:27,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:43:27,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403601446] [2022-12-13 16:43:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:43:27,726 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-12-13 16:43:27,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:43:27,727 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:27,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:43:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:43:28,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-13 16:43:28,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:43:28,859 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-12-13 16:43:28,892 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 10 treesize of output 9 [2022-12-13 16:43:28,907 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 16:43:28,908 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-12-13 16:43:28,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:43:28,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:43:29,168 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,175 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 3 [2022-12-13 16:43:29,198 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,258 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,266 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 3 [2022-12-13 16:43:29,291 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,350 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,354 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 3 [2022-12-13 16:43:29,378 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,438 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,443 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 3 [2022-12-13 16:43:29,463 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,518 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:29,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 16 treesize of output 18 [2022-12-13 16:43:29,573 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,577 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 3 [2022-12-13 16:43:29,608 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,678 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,682 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 3 [2022-12-13 16:43:29,712 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,770 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:29,789 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 16 treesize of output 18 [2022-12-13 16:43:29,822 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,827 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 3 [2022-12-13 16:43:29,854 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,915 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:29,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:29,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:29,940 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 16 treesize of output 18 [2022-12-13 16:43:29,972 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:43:29,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 16:43:29,977 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 3 [2022-12-13 16:43:30,005 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:30,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 16:43:30,076 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:30,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-12-13 16:43:30,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 16:43:30,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-13 16:43:30,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-12-13 16:43:30,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2022-12-13 16:43:30,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-12-13 16:43:30,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:43:30,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-12-13 16:43:30,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,460 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 20 treesize of output 22 [2022-12-13 16:43:30,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-12-13 16:43:30,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:43:30,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2022-12-13 16:43:31,825 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-12-13 16:43:31,828 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 25 treesize of output 13 [2022-12-13 16:43:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-12-13 16:43:31,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:43:32,919 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (and (forall ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_6698) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_6699) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0)))) (forall ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_6698) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-12-13 16:43:32,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6698) |c_ULTIMATE.start_main_~g~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6699) |c_ULTIMATE.start_main_~g~0#1.base|) .cse1)))) (forall ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6698) |c_ULTIMATE.start_main_~g~0#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))))) is different from false [2022-12-13 16:43:32,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~ret67#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1))) (and (forall ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6699 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6698) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6699) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1)))) (forall ((v_ArrVal_6698 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6698) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))))) is different from false [2022-12-13 16:44:20,049 WARN L233 SmtUtils]: Spent 47.06s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 16:44:46,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:44:46,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 134 [2022-12-13 16:44:46,026 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 172 treesize of output 154 [2022-12-13 16:44:46,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:44:46,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 120 [2022-12-13 16:44:46,078 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 176 treesize of output 146 [2022-12-13 16:44:46,093 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 106 treesize of output 90 [2022-12-13 16:44:46,108 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 90 treesize of output 74 [2022-12-13 16:44:46,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-12-13 16:44:46,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:44:46,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 156 [2022-12-13 16:44:46,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:44:46,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 228 [2022-12-13 16:44:46,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:44:46,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 154 [2022-12-13 16:44:46,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:44:46,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 78 [2022-12-13 16:44:46,412 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 74 treesize of output 66 [2022-12-13 16:44:46,434 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 36 treesize of output 28 [2022-12-13 16:44:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-12-13 16:44:47,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:44:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403601446] [2022-12-13 16:44:47,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403601446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:44:47,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:44:47,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-12-13 16:44:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067305572] [2022-12-13 16:44:47,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:44:47,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 16:44:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:44:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 16:44:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=829, Unknown=14, NotChecked=180, Total=1122 [2022-12-13 16:44:47,800 INFO L87 Difference]: Start difference. First operand 338 states and 430 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 28 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 16:45:03,624 WARN L233 SmtUtils]: Spent 15.04s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:45:05,641 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 [1] [2022-12-13 16:45:08,077 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 [1] [2022-12-13 16:45:10,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:45:13,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:45:46,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:46:44,288 WARN L233 SmtUtils]: Spent 54.82s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:46:46,331 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 [1] [2022-12-13 16:46:48,652 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 [1] [2022-12-13 16:46:50,874 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 [1] [2022-12-13 16:46:56,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:47:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:47:23,657 INFO L93 Difference]: Finished difference Result 370 states and 470 transitions. [2022-12-13 16:47:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 16:47:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 28 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-12-13 16:47:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:47:23,661 INFO L225 Difference]: With dead ends: 370 [2022-12-13 16:47:23,661 INFO L226 Difference]: Without dead ends: 370 [2022-12-13 16:47:23,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 175 SyntacticMatches, 23 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 114.2s TimeCoverageRelationStatistics Valid=263, Invalid=1980, Unknown=25, NotChecked=282, Total=2550 [2022-12-13 16:47:23,662 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 264 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 1860 mSolverCounterSat, 89 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1860 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 63.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:47:23,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 2487 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1860 Invalid, 14 Unknown, 506 Unchecked, 63.9s Time] [2022-12-13 16:47:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-12-13 16:47:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 338. [2022-12-13 16:47:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 217 states have (on average 1.3317972350230414) internal successors, (289), 253 states have internal predecessors, (289), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-12-13 16:47:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 429 transitions. [2022-12-13 16:47:23,670 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 429 transitions. Word has length 114 [2022-12-13 16:47:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:47:23,671 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 429 transitions. [2022-12-13 16:47:23,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 28 states have internal predecessors, (95), 7 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 16:47:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 429 transitions. [2022-12-13 16:47:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-13 16:47:23,672 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:47:23,672 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:47:23,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:47:23,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:47:23,873 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-13 16:47:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:47:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1590709928, now seen corresponding path program 1 times [2022-12-13 16:47:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:47:23,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665194429] [2022-12-13 16:47:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:47:23,874 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-12-13 16:47:23,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:47:23,875 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:47:23,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:47:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:47:25,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:47:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:47:26,750 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 16:47:26,750 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:47:26,751 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2022-12-13 16:47:26,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2022-12-13 16:47:26,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2022-12-13 16:47:26,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2022-12-13 16:47:26,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2022-12-13 16:47:26,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2022-12-13 16:47:26,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2022-12-13 16:47:26,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2022-12-13 16:47:26,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2022-12-13 16:47:26,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2022-12-13 16:47:26,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2022-12-13 16:47:26,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2022-12-13 16:47:26,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2022-12-13 16:47:26,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2022-12-13 16:47:26,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 16:47:26,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 16:47:26,963 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:47:26,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:47:26,990 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,991 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,994 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,995 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,996 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,996 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,996 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,997 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:26,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:26,998 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:26,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:26,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:26,999 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,001 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,003 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,005 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,006 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,007 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,008 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,009 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-12-13 16:47:27,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,010 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-12-13 16:47:27,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:47:27 BoogieIcfgContainer [2022-12-13 16:47:27,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:47:27,036 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:47:27,036 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:47:27,036 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:47:27,037 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:35:23" (3/4) ... [2022-12-13 16:47:27,039 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:47:27,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:47:27,039 INFO L158 Benchmark]: Toolchain (without parser) took 724534.37ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 54.6MB in the beginning and 30.8MB in the end (delta: 23.8MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.13ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 35.9MB in the end (delta: 18.7MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.77ms. Allocated memory is still 75.5MB. Free memory was 35.9MB in the beginning and 53.0MB in the end (delta: -17.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 75.5MB. Free memory was 53.0MB in the beginning and 50.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: RCFGBuilder took 797.47ms. Allocated memory is still 75.5MB. Free memory was 50.2MB in the beginning and 30.1MB in the end (delta: 20.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: TraceAbstraction took 723083.56ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 29.3MB in the beginning and 30.8MB in the end (delta: -1.5MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-12-13 16:47:27,039 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 100.7MB. Free memory is still 30.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:47:27,040 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.11ms. Allocated memory is still 56.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.13ms. Allocated memory is still 75.5MB. Free memory was 54.6MB in the beginning and 35.9MB in the end (delta: 18.7MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.77ms. Allocated memory is still 75.5MB. Free memory was 35.9MB in the beginning and 53.0MB in the end (delta: -17.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 75.5MB. Free memory was 53.0MB in the beginning and 50.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 797.47ms. Allocated memory is still 75.5MB. Free memory was 50.2MB in the beginning and 30.1MB in the end (delta: 20.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 723083.56ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 29.3MB in the beginning and 30.8MB in the end (delta: -1.5MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 100.7MB. Free memory is still 30.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 964]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 964. Possible FailurePath: [L966] DUPFF f, g, cf, cg, h; VAL [f={11:0}, g={25:0}] [L967] CALL, EXPR DUPFFnew(1) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=1, ans={6:0}, maxdeg=1] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={6:0}, malloc((maxdeg+1)*sizeof(FFelem))={5:0}, maxdeg=1] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=1, ans={6:0}, ans->coeffs={5:0}, maxdeg=1] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=1, ans={6:0}, maxdeg=1] [L901] ans->deg = -1 VAL [\old(maxdeg)=1, ans={6:0}, maxdeg=1] [L902] return ans; VAL [\old(maxdeg)=1, \result={6:0}, ans={6:0}, maxdeg=1] [L967] RET, EXPR DUPFFnew(1) VAL [DUPFFnew(1)={6:0}, f={11:0}, g={25:0}] [L967] f = DUPFFnew(1) [L967] EXPR f->coeffs VAL [f={6:0}, f={11:0}, f->coeffs={5:0}, g={25:0}] [L967] f->coeffs[1] = 1 VAL [f={6:0}, f={11:0}, f->coeffs={5:0}, g={25:0}] [L967] f->deg = 1 VAL [f={11:0}, f={6:0}, g={25:0}] [L968] CALL, EXPR DUPFFnew(2) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=2, ans={7:0}, maxdeg=2] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={7:0}, malloc((maxdeg+1)*sizeof(FFelem))={3:0}, maxdeg=2] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=2, ans={7:0}, ans->coeffs={3:0}, maxdeg=2] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=2, ans={7:0}, maxdeg=2] [L901] ans->deg = -1 VAL [\old(maxdeg)=2, ans={7:0}, maxdeg=2] [L902] return ans; VAL [\old(maxdeg)=2, \result={7:0}, ans={7:0}, maxdeg=2] [L968] RET, EXPR DUPFFnew(2) VAL [DUPFFnew(2)={7:0}, f={6:0}, f={11:0}, g={25:0}] [L968] g = DUPFFnew(2) [L968] EXPR g->coeffs VAL [f={6:0}, f={11:0}, g={25:0}, g={7:0}, g->coeffs={3:0}] [L968] g->coeffs[2] = 1 VAL [f={11:0}, f={6:0}, g={7:0}, g={25:0}, g->coeffs={3:0}] [L968] g->deg = 2 VAL [f={6:0}, f={11:0}, g={7:0}, g={25:0}] [L969] CALL, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [f={6:0}, fcofac={11:0}, g={7:0}, gcofac={25:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [f={6:0}] [L890] EXPR f->deg VAL [f={6:0}, f={6:0}, f->deg=1] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=1, f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [f={7:0}] [L890] EXPR f->deg VAL [f={7:0}, f={7:0}, f->deg=2] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=1, DUPFFdeg(g)=2, f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] COND TRUE DUPFFdeg(f) < DUPFFdeg(g) [L922] CALL, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [f={7:0}, fcofac={25:0}, g={6:0}, gcofac={11:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [f={7:0}] [L890] EXPR f->deg VAL [f={7:0}, f={7:0}, f->deg=2] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=2, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [f={6:0}] [L890] EXPR f->deg VAL [f={6:0}, f={6:0}, f->deg=1] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=2, DUPFFdeg(g)=1, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] COND FALSE !(DUPFFdeg(f) < DUPFFdeg(g)) [L923] CALL, EXPR DUPFFdeg(f) VAL [f={7:0}] [L890] EXPR f->deg VAL [f={7:0}, f={7:0}, f->deg=2] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(f) VAL [DUPFFdeg(f)=2, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] CALL, EXPR DUPFFdeg(g) VAL [f={6:0}] [L890] EXPR f->deg VAL [f={6:0}, f={6:0}, f->deg=1] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(g) VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, DUPFFdeg(g)=1, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [DUPFFdeg(f)=2, DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1=0, DUPFFdeg(g)=1, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L923] COND FALSE !(DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1) [L924] EXPR f->coeffs VAL [f={7:0}, f={7:0}, f->coeffs={3:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L924] EXPR f->coeffs[0] VAL [f={7:0}, f={7:0}, f->coeffs={3:0}, f->coeffs[0]=0, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L924] COND TRUE f->coeffs[0] == 0 [L924] return f; VAL [\result={7:0}, f={7:0}, f={7:0}, fcofac={25:0}, fcofac={25:0}, g={6:0}, g={6:0}, gcofac={11:0}, gcofac={11:0}] [L922] RET, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [DUPFFexgcd(gcofac, fcofac, g, f)={7:0}, f={6:0}, f={6:0}, fcofac={11:0}, fcofac={11:0}, g={7:0}, g={7:0}, gcofac={25:0}, gcofac={25:0}] [L922] return DUPFFexgcd(gcofac, fcofac, g, f); [L969] RET, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [DUPFFexgcd(&cf, &cg, f, g)={7:0}, f={6:0}, f={11:0}, g={25:0}, g={7:0}] [L969] h = DUPFFexgcd(&cf, &cg, f, g) [L970] h = h [L971] return 0; [L971] return 0; [L971] return 0; VAL [\result=0, f={6:0}, g={7:0}, h={7:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 187 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 723.0s, OverallIterations: 33, TraceHistogramMax: 20, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 447.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 119 mSolverCounterUnknown, 5776 SdHoareTripleChecker+Valid, 329.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5732 mSDsluCounter, 45506 SdHoareTripleChecker+Invalid, 317.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4037 IncrementalHoareTripleChecker+Unchecked, 39321 mSDsCounter, 2185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28560 IncrementalHoareTripleChecker+Invalid, 34901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2185 mSolverCounterUnsat, 6185 mSDtfsCounter, 28560 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3318 GetRequests, 2575 SyntacticMatches, 76 SemanticMatches, 667 ConstructedPredicates, 21 IntricatePredicates, 1 DeprecatedPredicates, 3821 ImplicationChecksByTransitivity, 180.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=29, InterpolantAutomatonStates: 458, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 624 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 12.0s SatisfiabilityAnalysisTime, 249.5s InterpolantComputationTime, 2040 NumberOfCodeBlocks, 1946 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3017 ConstructedInterpolants, 382 QuantifiedInterpolants, 31533 SizeOfPredicates, 255 NumberOfNonLiveVariables, 14404 ConjunctsInSsa, 695 ConjunctsInUnsatCore, 49 InterpolantComputations, 15 PerfectInterpolantSequences, 7266/8570 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:47:27,245 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 16:47:27,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c5fd38c-3311-460b-8b55-00b458264222/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample