./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:49:19,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:49:19,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:49:19,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:49:19,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:49:19,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:49:19,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:49:19,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:49:19,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:49:19,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:49:19,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:49:19,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:49:19,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:49:19,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:49:19,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:49:19,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:49:19,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:49:19,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:49:19,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:49:19,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:49:19,322 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:49:19,322 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:49:19,323 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:49:19,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:49:19,323 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:49:19,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:49:19,324 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:49:19,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:49:19,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:49:19,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:49:19,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:49:19,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:49:19,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:49:19,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:19,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:49:19,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:49:19,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:49:19,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:49:19,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:49:19,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:49:19,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:49:19,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:49:19,329 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2024-11-09 07:49:19,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:49:19,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:49:19,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:49:19,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:49:19,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:49:19,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-09 07:49:21,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:49:21,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:49:21,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-09 07:49:21,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd701ce34/75a3a927f11a4805b6b799bfe8cc10de/FLAGb7c017c8c [2024-11-09 07:49:21,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd701ce34/75a3a927f11a4805b6b799bfe8cc10de [2024-11-09 07:49:21,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:49:21,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:49:21,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:21,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:49:21,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:49:21,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:21" (1/1) ... [2024-11-09 07:49:21,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb9bd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:21, skipping insertion in model container [2024-11-09 07:49:21,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:21" (1/1) ... [2024-11-09 07:49:21,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:21,898 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:21,941 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:21,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:21,972 ERROR L321 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) [2024-11-09 07:49:21,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12d74e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:21, skipping insertion in model container [2024-11-09 07:49:21,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:21,974 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:49:21,975 INFO L158 Benchmark]: Toolchain (without parser) took 485.98ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 67.5MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:49:21,976 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:49:21,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.71ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 67.6MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:49:21,978 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.71ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 67.6MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:49:24,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:49:24,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:49:24,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:49:24,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:49:24,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:49:24,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:49:24,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:49:24,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:49:24,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:49:24,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:49:24,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:49:24,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:49:24,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:49:24,242 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:49:24,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:49:24,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:49:24,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:49:24,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:49:24,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:49:24,244 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:49:24,247 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:49:24,248 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:49:24,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:49:24,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:49:24,248 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:49:24,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:49:24,249 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:49:24,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:49:24,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:49:24,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:49:24,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:49:24,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:49:24,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:49:24,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:49:24,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:24,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:49:24,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:49:24,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:49:24,260 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:24,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:49:24,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:49:24,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:49:24,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:49:24,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2024-11-09 07:49:24,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:49:24,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:49:24,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:49:24,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:49:24,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:49:24,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-09 07:49:26,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:49:26,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:49:26,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-09 07:49:26,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31b8ff79/1c6aece297c64b1a813a1808cfb5718f/FLAG6f1c03146 [2024-11-09 07:49:26,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31b8ff79/1c6aece297c64b1a813a1808cfb5718f [2024-11-09 07:49:26,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:49:26,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:49:26,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:26,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:49:26,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:49:26,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:26" (1/1) ... [2024-11-09 07:49:26,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fcd2b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:26, skipping insertion in model container [2024-11-09 07:49:26,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:26" (1/1) ... [2024-11-09 07:49:26,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:27,154 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:27,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:27,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:27,259 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:49:27,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:49:27,292 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:27,331 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:49:27,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:27,353 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:49:27,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:49:27,468 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:49:27,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27 WrapperNode [2024-11-09 07:49:27,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:49:27,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:49:27,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:49:27,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:49:27,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,531 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 65 [2024-11-09 07:49:27,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:49:27,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:49:27,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:49:27,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:49:27,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,584 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 8 writes are split as follows [0, 8]. [2024-11-09 07:49:27,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:49:27,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:49:27,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:49:27,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:49:27,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (1/1) ... [2024-11-09 07:49:27,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:49:27,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:49:27,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:49:27,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:49:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:49:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-09 07:49:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 07:49:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 07:49:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:49:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:49:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-09 07:49:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-09 07:49:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:49:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:49:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:49:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-09 07:49:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-09 07:49:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:49:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:49:27,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:49:27,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:49:28,358 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-09 07:49:28,358 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:49:28,377 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:49:28,378 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:49:28,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:49:28 BoogieIcfgContainer [2024-11-09 07:49:28,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:49:28,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:49:28,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:49:28,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:49:28,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:49:26" (1/3) ... [2024-11-09 07:49:28,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15455052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:28, skipping insertion in model container [2024-11-09 07:49:28,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:27" (2/3) ... [2024-11-09 07:49:28,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15455052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:28, skipping insertion in model container [2024-11-09 07:49:28,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:49:28" (3/3) ... [2024-11-09 07:49:28,387 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2024-11-09 07:49:28,403 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:49:28,404 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-09 07:49:28,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:49:28,465 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3236a4bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:49:28,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-09 07:49:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 45 states have (on average 1.8) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:49:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:49:28,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:28,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:28,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:28,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash -850861144, now seen corresponding path program 1 times [2024-11-09 07:49:28,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:28,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139768670] [2024-11-09 07:49:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:28,504 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 [2024-11-09 07:49:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:28,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:28,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:28,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:28,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:28,836 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:49:28,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:49:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:28,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:28,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139768670] [2024-11-09 07:49:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139768670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545473913] [2024-11-09 07:49:28,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:28,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:49:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:28,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:49:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2024-11-09 07:49:28,983 INFO L87 Difference]: Start difference. First operand has 88 states, 45 states have (on average 1.8) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-09 07:49:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:29,659 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2024-11-09 07:49:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:29,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2024-11-09 07:49:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:29,691 INFO L225 Difference]: With dead ends: 129 [2024-11-09 07:49:29,692 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:49:29,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=70, Unknown=1, NotChecked=0, Total=110 [2024-11-09 07:49:29,701 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 169 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:29,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 125 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 289 Invalid, 30 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:49:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:49:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 84. [2024-11-09 07:49:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:49:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-09 07:49:29,794 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 12 [2024-11-09 07:49:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:29,794 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-09 07:49:29,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2024-11-09 07:49:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-09 07:49:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:49:29,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:29,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:29,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-11-09 07:49:29,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:30,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -850861143, now seen corresponding path program 1 times [2024-11-09 07:49:30,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207839979] [2024-11-09 07:49:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:30,001 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 [2024-11-09 07:49:30,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:30,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:30,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:30,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:49:30,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:30,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:30,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:30,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:30,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207839979] [2024-11-09 07:49:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207839979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:30,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:49:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435839299] [2024-11-09 07:49:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:30,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:49:30,399 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 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) [2024-11-09 07:49:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:31,146 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-11-09 07:49:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:49:31,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 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 12 [2024-11-09 07:49:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:31,148 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:49:31,148 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 07:49:31,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:49:31,150 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:31,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 103 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:49:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 07:49:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 82. [2024-11-09 07:49:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:49:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2024-11-09 07:49:31,158 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 12 [2024-11-09 07:49:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:31,159 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2024-11-09 07:49:31,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 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) [2024-11-09 07:49:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2024-11-09 07:49:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:49:31,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:31,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:31,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:31,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:31,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:31,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash 892712228, now seen corresponding path program 1 times [2024-11-09 07:49:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844308954] [2024-11-09 07:49:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:31,362 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 [2024-11-09 07:49:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:31,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:31,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:31,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:49:31,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:31,497 INFO L378 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 [2024-11-09 07:49:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:31,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:31,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844308954] [2024-11-09 07:49:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844308954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:49:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517628479] [2024-11-09 07:49:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:31,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:31,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:49:31,535 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:31,881 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2024-11-09 07:49:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:49:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 07:49:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:31,884 INFO L225 Difference]: With dead ends: 115 [2024-11-09 07:49:31,885 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 07:49:31,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:49:31,886 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 57 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:31,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 329 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:49:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 07:49:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2024-11-09 07:49:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:49:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-09 07:49:31,901 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 15 [2024-11-09 07:49:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:31,901 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-09 07:49:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-09 07:49:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:49:31,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:31,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:31,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:32,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:32,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 892712229, now seen corresponding path program 1 times [2024-11-09 07:49:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850938078] [2024-11-09 07:49:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:32,105 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 [2024-11-09 07:49:32,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:32,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:32,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:32,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:49:32,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:32,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:32,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:32,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:32,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:32,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850938078] [2024-11-09 07:49:32,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850938078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:32,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:49:32,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860588368] [2024-11-09 07:49:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:32,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:49:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:49:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:49:32,668 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:33,868 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-09 07:49:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:49:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 07:49:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:33,871 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:49:33,872 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:49:33,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:49:33,874 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 122 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:33,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 258 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:49:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:49:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-11-09 07:49:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:49:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-09 07:49:33,885 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 15 [2024-11-09 07:49:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:33,885 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-09 07:49:33,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-09 07:49:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:49:33,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:33,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:33,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:34,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:34,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:34,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash -605397139, now seen corresponding path program 1 times [2024-11-09 07:49:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542292797] [2024-11-09 07:49:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:34,089 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 [2024-11-09 07:49:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:34,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:34,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:34,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:34,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:34,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:34,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542292797] [2024-11-09 07:49:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542292797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:34,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836195154] [2024-11-09 07:49:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:34,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:34,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:34,161 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-09 07:49:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:34,187 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-09 07:49:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-09 07:49:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:34,189 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:49:34,189 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:49:34,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:34,191 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:34,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:49:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-09 07:49:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:49:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-09 07:49:34,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2024-11-09 07:49:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:34,197 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-09 07:49:34,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-09 07:49:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-09 07:49:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:49:34,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:34,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:34,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:34,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:34,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1882115694, now seen corresponding path program 1 times [2024-11-09 07:49:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012856946] [2024-11-09 07:49:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:34,401 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 [2024-11-09 07:49:34,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:34,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:34,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:34,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:34,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:34,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:34,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012856946] [2024-11-09 07:49:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012856946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478113964] [2024-11-09 07:49:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:34,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:34,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:34,595 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-09 07:49:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:34,906 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2024-11-09 07:49:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:34,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-09 07:49:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:34,907 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:49:34,907 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:49:34,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:34,908 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 62 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:34,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 136 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:49:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:49:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2024-11-09 07:49:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 81 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:49:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-09 07:49:34,915 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 13 [2024-11-09 07:49:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:34,915 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-09 07:49:34,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-09 07:49:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-09 07:49:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:49:34,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:34,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:34,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:49:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:35,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1882115695, now seen corresponding path program 1 times [2024-11-09 07:49:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073237341] [2024-11-09 07:49:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:35,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:35,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:35,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:35,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:35,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:49:35,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:35,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:35,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:35,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073237341] [2024-11-09 07:49:35,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073237341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:35,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:35,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718885336] [2024-11-09 07:49:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:35,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:35,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:35,390 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-09 07:49:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:35,711 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-09 07:49:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-09 07:49:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:35,713 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:49:35,713 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:49:35,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:35,714 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 31 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:35,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 231 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:49:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:49:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2024-11-09 07:49:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:49:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2024-11-09 07:49:35,726 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 13 [2024-11-09 07:49:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:35,726 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2024-11-09 07:49:35,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-09 07:49:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2024-11-09 07:49:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:49:35,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:35,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:35,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:35,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1904275298, now seen corresponding path program 1 times [2024-11-09 07:49:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479732816] [2024-11-09 07:49:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:35,929 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 [2024-11-09 07:49:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:35,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:35,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:35,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:35,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:36,007 INFO L378 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 [2024-11-09 07:49:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:36,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:36,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479732816] [2024-11-09 07:49:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479732816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:36,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:49:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053332255] [2024-11-09 07:49:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:36,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:49:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:49:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:36,079 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:36,454 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2024-11-09 07:49:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:49:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 07:49:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:36,456 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:49:36,456 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:49:36,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:49:36,457 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:36,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 353 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:49:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:49:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-11-09 07:49:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:49:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2024-11-09 07:49:36,466 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 16 [2024-11-09 07:49:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:36,466 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2024-11-09 07:49:36,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2024-11-09 07:49:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:49:36,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:36,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:36,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:36,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1904275299, now seen corresponding path program 1 times [2024-11-09 07:49:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074765252] [2024-11-09 07:49:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:36,670 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 [2024-11-09 07:49:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:36,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:36,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:36,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:49:36,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:36,744 INFO L378 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 [2024-11-09 07:49:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:36,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:36,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074765252] [2024-11-09 07:49:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074765252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:36,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:49:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171470088] [2024-11-09 07:49:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:36,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:49:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:49:36,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:49:36,864 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:37,234 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2024-11-09 07:49:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:49:37,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 07:49:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:37,236 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:49:37,236 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:49:37,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:49:37,237 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 20 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:37,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 454 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:49:37,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:49:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-11-09 07:49:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:49:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2024-11-09 07:49:37,245 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2024-11-09 07:49:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:37,246 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2024-11-09 07:49:37,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2024-11-09 07:49:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:49:37,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:37,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:37,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:37,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2033358017, now seen corresponding path program 1 times [2024-11-09 07:49:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607466360] [2024-11-09 07:49:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:37,449 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 [2024-11-09 07:49:37,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:37,452 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:37,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:37,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:37,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:37,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:37,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607466360] [2024-11-09 07:49:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607466360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194937613] [2024-11-09 07:49:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:37,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:37,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:37,544 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:37,562 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-09 07:49:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 07:49:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:37,563 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:49:37,563 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:49:37,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:37,564 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:37,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:49:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 07:49:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:49:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2024-11-09 07:49:37,567 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 16 [2024-11-09 07:49:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:37,568 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2024-11-09 07:49:37,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-09 07:49:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:49:37,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:37,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:37,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:37,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:37,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:37,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash 352493573, now seen corresponding path program 1 times [2024-11-09 07:49:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576945962] [2024-11-09 07:49:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:37,772 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 [2024-11-09 07:49:37,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:37,774 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:37,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:37,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:37,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:37,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:37,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576945962] [2024-11-09 07:49:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576945962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967771277] [2024-11-09 07:49:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:37,857 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:37,955 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2024-11-09 07:49:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 07:49:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:37,956 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:49:37,956 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:49:37,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:37,957 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:37,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 198 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:49:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:49:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 07:49:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:49:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2024-11-09 07:49:37,960 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 18 [2024-11-09 07:49:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:37,961 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2024-11-09 07:49:37,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2024-11-09 07:49:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:49:37,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:37,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:37,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:38,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:38,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:38,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 352493574, now seen corresponding path program 1 times [2024-11-09 07:49:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971159585] [2024-11-09 07:49:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:38,163 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 [2024-11-09 07:49:38,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:38,165 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:38,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:38,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:38,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:38,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:38,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971159585] [2024-11-09 07:49:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971159585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:38,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:38,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:49:38,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121464245] [2024-11-09 07:49:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:38,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:38,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:49:38,321 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:38,540 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-11-09 07:49:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:49:38,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 07:49:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:38,541 INFO L225 Difference]: With dead ends: 84 [2024-11-09 07:49:38,541 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 07:49:38,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:49:38,542 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:38,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 264 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:49:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 07:49:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 07:49:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:49:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-11-09 07:49:38,545 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 18 [2024-11-09 07:49:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:38,545 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-11-09 07:49:38,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:49:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-11-09 07:49:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:49:38,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:38,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:38,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:38,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:38,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1589206981, now seen corresponding path program 1 times [2024-11-09 07:49:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147369862] [2024-11-09 07:49:38,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:38,748 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 [2024-11-09 07:49:38,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:38,749 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:38,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:38,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:38,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:38,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:38,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147369862] [2024-11-09 07:49:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147369862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:38,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238780221] [2024-11-09 07:49:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:38,910 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-09 07:49:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:39,183 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2024-11-09 07:49:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 19 [2024-11-09 07:49:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:39,184 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:49:39,184 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:49:39,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:39,185 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 90 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:39,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 114 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:49:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:49:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2024-11-09 07:49:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 07:49:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 07:49:39,188 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 19 [2024-11-09 07:49:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:39,188 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 07:49:39,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-09 07:49:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 07:49:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:49:39,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:39,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:39,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:39,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:39,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:39,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1589206982, now seen corresponding path program 1 times [2024-11-09 07:49:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853403320] [2024-11-09 07:49:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:39,392 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 [2024-11-09 07:49:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:39,393 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:39,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:39,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:49:39,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:39,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:39,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853403320] [2024-11-09 07:49:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853403320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:49:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510390455] [2024-11-09 07:49:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:39,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:39,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:49:39,603 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-09 07:49:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:39,813 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2024-11-09 07:49:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 19 [2024-11-09 07:49:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:39,815 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:49:39,815 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:49:39,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:49:39,815 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 20 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:39,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 230 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:49:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:49:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-11-09 07:49:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:49:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-09 07:49:39,820 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 19 [2024-11-09 07:49:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:39,820 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-09 07:49:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-09 07:49:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-09 07:49:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:49:39,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:39,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:39,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:40,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:40,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1482879725, now seen corresponding path program 1 times [2024-11-09 07:49:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900636096] [2024-11-09 07:49:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:40,023 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 [2024-11-09 07:49:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:40,026 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:40,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:40,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:40,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:40,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:40,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900636096] [2024-11-09 07:49:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900636096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:40,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:40,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:49:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417711182] [2024-11-09 07:49:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:40,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:49:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:40,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:49:40,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:49:40,127 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:49:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:40,283 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2024-11-09 07:49:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:49:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 07:49:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:40,284 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:49:40,285 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 07:49:40,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:49:40,285 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:40,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 82 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:49:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 07:49:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 07:49:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:49:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-09 07:49:40,288 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 24 [2024-11-09 07:49:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:40,289 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-09 07:49:40,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:49:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-09 07:49:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:49:40,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:40,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:40,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:40,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:40,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1363387823, now seen corresponding path program 1 times [2024-11-09 07:49:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621043324] [2024-11-09 07:49:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:40,495 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 [2024-11-09 07:49:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:40,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:40,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:40,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:49:40,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:40,579 INFO L378 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 [2024-11-09 07:49:40,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:40,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 07:49:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:40,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:40,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621043324] [2024-11-09 07:49:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621043324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:40,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:49:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144512205] [2024-11-09 07:49:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:49:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:49:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:49:40,863 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:41,618 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2024-11-09 07:49:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:49:41,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-11-09 07:49:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:41,620 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:49:41,620 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:49:41,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:49:41,621 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 84 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:41,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 293 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:49:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:49:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2024-11-09 07:49:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 72 states have internal predecessors, (77), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:49:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-09 07:49:41,627 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 27 [2024-11-09 07:49:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:41,627 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-09 07:49:41,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-09 07:49:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:49:41,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:41,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:41,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:41,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:41,829 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:41,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1363387824, now seen corresponding path program 1 times [2024-11-09 07:49:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361692593] [2024-11-09 07:49:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:41,830 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 [2024-11-09 07:49:41,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:41,833 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:41,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:41,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:49:41,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:41,949 INFO L378 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 [2024-11-09 07:49:42,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:42,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:49:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:42,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:42,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361692593] [2024-11-09 07:49:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361692593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:42,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:49:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27140015] [2024-11-09 07:49:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:49:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:49:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:49:42,327 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:43,053 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-09 07:49:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:49:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-11-09 07:49:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:43,054 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:49:43,054 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:49:43,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:49:43,055 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:43,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 375 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:49:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:49:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2024-11-09 07:49:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 71 states have internal predecessors, (75), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:49:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-09 07:49:43,060 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 27 [2024-11-09 07:49:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:43,061 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-09 07:49:43,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-09 07:49:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:49:43,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:43,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:43,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-11-09 07:49:43,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:43,265 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:43,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1119661157, now seen corresponding path program 1 times [2024-11-09 07:49:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782251248] [2024-11-09 07:49:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:43,266 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 [2024-11-09 07:49:43,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:43,267 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:43,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:43,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:49:43,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:43,375 INFO L378 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 [2024-11-09 07:49:43,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:43,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 07:49:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:43,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:43,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:43,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782251248] [2024-11-09 07:49:43,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782251248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:43,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:49:43,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248539632] [2024-11-09 07:49:43,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:49:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:43,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:49:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:49:43,715 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:44,617 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2024-11-09 07:49:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:49:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-11-09 07:49:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:44,618 INFO L225 Difference]: With dead ends: 103 [2024-11-09 07:49:44,618 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 07:49:44,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:49:44,619 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:44,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 301 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:49:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 07:49:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2024-11-09 07:49:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 78 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:49:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2024-11-09 07:49:44,622 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 32 [2024-11-09 07:49:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:44,623 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-11-09 07:49:44,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2024-11-09 07:49:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:49:44,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:44,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:44,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 07:49:44,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:44,825 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:44,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1119661156, now seen corresponding path program 1 times [2024-11-09 07:49:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266066587] [2024-11-09 07:49:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:44,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:44,827 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:44,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:44,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:49:44,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:44,935 INFO L378 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 [2024-11-09 07:49:45,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:45,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:45,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:49:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:45,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:45,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266066587] [2024-11-09 07:49:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266066587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 07:49:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235173122] [2024-11-09 07:49:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:45,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:49:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:45,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:49:45,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:49:45,348 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:46,189 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2024-11-09 07:49:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:49:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-11-09 07:49:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:46,190 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:49:46,190 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:49:46,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:49:46,191 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:46,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 403 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:49:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:49:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-11-09 07:49:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 78 states have internal predecessors, (86), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:49:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-09 07:49:46,194 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 32 [2024-11-09 07:49:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:46,195 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-09 07:49:46,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-09 07:49:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:49:46,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:46,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:46,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:46,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:46,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:46,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash -351927737, now seen corresponding path program 1 times [2024-11-09 07:49:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:46,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298889343] [2024-11-09 07:49:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:46,397 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 [2024-11-09 07:49:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:46,398 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:46,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:46,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:49:46,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:46,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:46,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:46,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298889343] [2024-11-09 07:49:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298889343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:46,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:49:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849681849] [2024-11-09 07:49:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:46,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:49:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:49:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:49:46,698 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:47,073 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-09 07:49:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:49:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2024-11-09 07:49:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:47,074 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:49:47,074 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:49:47,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:49:47,075 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:47,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 455 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:49:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:49:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-09 07:49:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:49:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-09 07:49:47,078 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2024-11-09 07:49:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:47,079 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-09 07:49:47,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-09 07:49:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:49:47,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:47,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:47,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:47,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:47,280 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:47,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1109518277, now seen corresponding path program 1 times [2024-11-09 07:49:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767077141] [2024-11-09 07:49:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:47,282 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 [2024-11-09 07:49:47,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:47,284 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:47,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 07:49:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:47,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:49:47,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:47,478 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:47,478 INFO L378 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 [2024-11-09 07:49:47,525 INFO L378 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 7 treesize of output 3 [2024-11-09 07:49:47,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:47,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:49:47,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:49:48,701 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-09 07:49:48,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2024-11-09 07:49:48,986 INFO L378 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 7 treesize of output 3 [2024-11-09 07:49:49,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-09 07:49:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:49,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:49,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767077141] [2024-11-09 07:49:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767077141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-09 07:49:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899701952] [2024-11-09 07:49:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:49,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:49:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:49,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:49:49,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:49:49,609 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:51,753 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2024-11-09 07:49:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:49:51,754 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-09 07:49:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:51,755 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:49:51,755 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:49:51,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 07:49:51,756 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 16 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:51,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 446 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 798 Invalid, 12 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:49:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:49:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-09 07:49:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:49:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-09 07:49:51,758 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 35 [2024-11-09 07:49:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:51,759 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-09 07:49:51,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-09 07:49:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:49:51,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:51,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:49:51,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:51,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:51,960 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:49:51,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1109518276, now seen corresponding path program 1 times [2024-11-09 07:49:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561020958] [2024-11-09 07:49:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:51,961 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 [2024-11-09 07:49:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:51,962 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:49:51,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:49:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:52,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-09 07:49:52,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:52,195 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:52,195 INFO L378 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 [2024-11-09 07:49:52,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:52,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:52,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:49:52,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:49:52,896 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-09 07:49:52,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 52 [2024-11-09 07:49:52,954 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-09 07:49:52,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 66 [2024-11-09 07:49:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:54,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:54,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561020958] [2024-11-09 07:49:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561020958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-09 07:49:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220269221] [2024-11-09 07:49:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:49:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:49:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:49:54,546 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:49:59,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:50:04,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:50:08,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:50:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:08,697 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-09 07:50:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:50:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-09 07:50:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:08,699 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:50:08,699 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:50:08,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=161, Invalid=1321, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:50:08,700 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 82 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:08,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 560 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 859 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2024-11-09 07:50:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:50:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-09 07:50:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-09 07:50:08,705 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 35 [2024-11-09 07:50:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:08,706 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-09 07:50:08,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 19 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:50:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-09 07:50:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:50:08,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:08,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:08,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:08,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:08,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash -35328223, now seen corresponding path program 1 times [2024-11-09 07:50:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:08,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331845380] [2024-11-09 07:50:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:08,908 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 [2024-11-09 07:50:08,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:08,910 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:08,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:09,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:50:09,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:09,070 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:09,071 INFO L378 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 [2024-11-09 07:50:09,258 INFO L378 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 [2024-11-09 07:50:09,314 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 07:50:09,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 34 [2024-11-09 07:50:09,318 INFO L378 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 23 treesize of output 13 [2024-11-09 07:50:09,561 INFO L378 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 17 [2024-11-09 07:50:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:09,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:09,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331845380] [2024-11-09 07:50:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331845380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:09,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:09,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-09 07:50:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283834698] [2024-11-09 07:50:09,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:09,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:50:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:50:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:50:09,947 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:50:15,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:50:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:16,219 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2024-11-09 07:50:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:50:16,220 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-11-09 07:50:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:16,221 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:50:16,221 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:50:16,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 07:50:16,222 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 146 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 23 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:16,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 219 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 936 Invalid, 6 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 07:50:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:50:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-09 07:50:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 72 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2024-11-09 07:50:16,224 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 36 [2024-11-09 07:50:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:16,224 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2024-11-09 07:50:16,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:50:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2024-11-09 07:50:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:50:16,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:16,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:16,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-11-09 07:50:16,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:16,426 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:16,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash -35328222, now seen corresponding path program 1 times [2024-11-09 07:50:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:16,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955435678] [2024-11-09 07:50:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:16,427 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 [2024-11-09 07:50:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:16,429 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:16,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:16,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:50:16,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:16,625 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:16,625 INFO L378 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 [2024-11-09 07:50:16,842 INFO L378 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 [2024-11-09 07:50:16,849 INFO L378 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 [2024-11-09 07:50:16,933 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 07:50:16,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 34 [2024-11-09 07:50:16,980 INFO L349 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2024-11-09 07:50:16,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 42 [2024-11-09 07:50:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:17,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:17,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955435678] [2024-11-09 07:50:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955435678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:17,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 07:50:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641824778] [2024-11-09 07:50:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:50:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:50:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:50:17,855 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:50:23,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:50:27,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:50:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:28,329 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2024-11-09 07:50:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:50:28,330 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-11-09 07:50:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:28,330 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:50:28,331 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:50:28,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:50:28,332 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 106 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:28,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 285 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 961 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-09 07:50:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:50:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-09 07:50:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 72 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2024-11-09 07:50:28,334 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 36 [2024-11-09 07:50:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:28,335 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2024-11-09 07:50:28,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:50:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2024-11-09 07:50:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:50:28,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:28,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:28,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:28,537 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 522849360, now seen corresponding path program 1 times [2024-11-09 07:50:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41385218] [2024-11-09 07:50:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:28,538 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 [2024-11-09 07:50:28,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:28,539 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:28,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:28,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:50:28,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:28,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:50:29,087 INFO L378 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 [2024-11-09 07:50:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:29,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:29,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41385218] [2024-11-09 07:50:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41385218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:50:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995228240] [2024-11-09 07:50:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:50:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:50:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:50:29,327 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:30,129 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2024-11-09 07:50:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:50:30,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2024-11-09 07:50:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:30,130 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:50:30,130 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:50:30,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:50:30,131 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:30,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 418 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:50:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:50:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 07:50:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 72 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2024-11-09 07:50:30,134 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 41 [2024-11-09 07:50:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:30,134 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2024-11-09 07:50:30,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2024-11-09 07:50:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:50:30,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:30,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:30,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-09 07:50:30,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:30,336 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1640982584, now seen corresponding path program 1 times [2024-11-09 07:50:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:30,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966886372] [2024-11-09 07:50:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:30,337 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 [2024-11-09 07:50:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:30,338 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:30,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:30,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 07:50:30,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:30,591 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:30,591 INFO L378 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 [2024-11-09 07:50:30,643 INFO L378 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 7 treesize of output 3 [2024-11-09 07:50:30,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:50:30,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:50:31,047 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-09 07:50:31,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2024-11-09 07:50:31,321 INFO L378 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 7 treesize of output 3 [2024-11-09 07:50:31,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-09 07:50:32,011 INFO L349 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2024-11-09 07:50:32,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 23 [2024-11-09 07:50:32,102 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-09 07:50:32,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-09 07:50:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:32,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:32,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:32,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966886372] [2024-11-09 07:50:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966886372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-09 07:50:32,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372214325] [2024-11-09 07:50:32,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:32,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 07:50:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 07:50:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:50:32,190 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 27 states, 25 states have (on average 1.44) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:35,474 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2024-11-09 07:50:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 07:50:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.44) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2024-11-09 07:50:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:35,475 INFO L225 Difference]: With dead ends: 127 [2024-11-09 07:50:35,476 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 07:50:35,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=305, Invalid=2451, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 07:50:35,477 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 155 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 40 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:35,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 398 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1053 Invalid, 4 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 07:50:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 07:50:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2024-11-09 07:50:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 74 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2024-11-09 07:50:35,480 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 44 [2024-11-09 07:50:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2024-11-09 07:50:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.44) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2024-11-09 07:50:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:50:35,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:35,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:35,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:35,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:35,682 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:35,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1640982583, now seen corresponding path program 1 times [2024-11-09 07:50:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097575474] [2024-11-09 07:50:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:35,683 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 [2024-11-09 07:50:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:35,684 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:35,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:35,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:50:35,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:35,981 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:35,981 INFO L378 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 [2024-11-09 07:50:36,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:50:36,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:50:36,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:36,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:50:36,652 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2024-11-09 07:50:36,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 70 [2024-11-09 07:50:36,765 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-09 07:50:36,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 103 [2024-11-09 07:50:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:38,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:38,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097575474] [2024-11-09 07:50:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097575474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:38,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:38,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-09 07:50:38,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022075660] [2024-11-09 07:50:38,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:38,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 07:50:38,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:38,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 07:50:38,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:50:38,483 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 27 states, 25 states have (on average 1.44) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:44,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:50:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:45,471 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2024-11-09 07:50:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 07:50:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.44) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2024-11-09 07:50:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:45,473 INFO L225 Difference]: With dead ends: 87 [2024-11-09 07:50:45,473 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:50:45,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=186, Invalid=1792, Unknown=2, NotChecked=0, Total=1980 [2024-11-09 07:50:45,474 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:45,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 495 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 915 Invalid, 3 Unknown, 0 Unchecked, 5.8s Time] [2024-11-09 07:50:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:50:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 07:50:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.293103448275862) internal successors, (75), 74 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2024-11-09 07:50:45,477 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 44 [2024-11-09 07:50:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:45,477 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2024-11-09 07:50:45,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.44) internal successors, (36), 22 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:50:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2024-11-09 07:50:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:50:45,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:45,478 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:45,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:45,679 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -999377225, now seen corresponding path program 1 times [2024-11-09 07:50:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108195447] [2024-11-09 07:50:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:45,680 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 [2024-11-09 07:50:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:45,681 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:45,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:45,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:50:45,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:45,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:45,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108195447] [2024-11-09 07:50:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108195447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:45,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330842972] [2024-11-09 07:50:45,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:45,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:50:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:50:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:50:45,834 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:50:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:45,991 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2024-11-09 07:50:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-11-09 07:50:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:45,992 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:50:45,992 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:50:45,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:45,993 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:45,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 187 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:50:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:50:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 07:50:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 72 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:50:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2024-11-09 07:50:45,995 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 49 [2024-11-09 07:50:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:45,996 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2024-11-09 07:50:45,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:50:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2024-11-09 07:50:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:50:45,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:45,996 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:46,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:46,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:46,197 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-09 07:50:46,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -999377224, now seen corresponding path program 1 times [2024-11-09 07:50:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490437407] [2024-11-09 07:50:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:46,198 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 [2024-11-09 07:50:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:46,199 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-11-09 07:50:46,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-09 07:50:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:46,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:50:46,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:46,514 INFO L378 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 [2024-11-09 07:50:46,516 INFO L378 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 20 [2024-11-09 07:50:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:46,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:47,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:50:47,633 INFO L378 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 44 treesize of output 46 [2024-11-09 07:50:48,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:50:48,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 151 [2024-11-09 07:50:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:51,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490437407] [2024-11-09 07:50:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490437407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:51,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:51,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2024-11-09 07:50:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036438676] [2024-11-09 07:50:51,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:50:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:50:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:50:51,068 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)