./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:46:31,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:46:31,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:46:31,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:46:31,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:46:31,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:46:31,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:46:31,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:46:31,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:46:31,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:46:31,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:46:31,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:46:31,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:46:31,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:46:31,372 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:46:31,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:46:31,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:46:31,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:46:31,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:46:31,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:46:31,378 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:46:31,378 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:46:31,379 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:46:31,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:46:31,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:46:31,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:46:31,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:46:31,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:46:31,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:46:31,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:46:31,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:46:31,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:46:31,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:46:31,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:31,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:46:31,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:46:31,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:46:31,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:46:31,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:46:31,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:46:31,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:46:31,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:46:31,386 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-19 06:46:31,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:46:31,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:46:31,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:46:31,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:46:31,701 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:46:31,702 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-19 06:46:33,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:46:33,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:46:33,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-19 06:46:33,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078ae2254/d1795b7c3d0e4d1794dffe2ea01a9a67/FLAG99c9c059c [2024-11-19 06:46:33,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078ae2254/d1795b7c3d0e4d1794dffe2ea01a9a67 [2024-11-19 06:46:33,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:46:33,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:46:33,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:33,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:46:33,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:46:33,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:33" (1/1) ... [2024-11-19 06:46:33,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e85eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:33, skipping insertion in model container [2024-11-19 06:46:33,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:33" (1/1) ... [2024-11-19 06:46:33,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:46:33,783 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-19 06:46:33,837 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-19 06:46:33,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:33,864 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-19 06:46:33,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@375d9ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:33, skipping insertion in model container [2024-11-19 06:46:33,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:33,866 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:46:33,868 INFO L158 Benchmark]: Toolchain (without parser) took 416.23ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 82.0MB in the beginning and 195.3MB in the end (delta: -113.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-19 06:46:33,868 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:46:33,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.34ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 81.8MB in the beginning and 195.3MB in the end (delta: -113.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-19 06:46:33,870 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.12ms. Allocated memory is still 155.2MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.34ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 81.8MB in the beginning and 195.3MB in the end (delta: -113.5MB). Peak memory consumption was 8.5MB. 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:46:35,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:46:35,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:46:35,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:46:35,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:46:36,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:46:36,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:46:36,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:46:36,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:46:36,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:46:36,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:46:36,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:46:36,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:46:36,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:46:36,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:46:36,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:46:36,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:46:36,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:46:36,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:46:36,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:46:36,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:46:36,019 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:46:36,019 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:46:36,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:46:36,020 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:46:36,020 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:46:36,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:46:36,020 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:46:36,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:46:36,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:46:36,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:46:36,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:46:36,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:46:36,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:46:36,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:46:36,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:36,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:46:36,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:46:36,023 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:46:36,023 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:46:36,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:46:36,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:46:36,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:46:36,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:46:36,024 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-19 06:46:36,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:46:36,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:46:36,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:46:36,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:46:36,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:46:36,302 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-19 06:46:37,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:46:37,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:46:37,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-11-19 06:46:37,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e5a7027/439445e0263e4a97b2f8db64ceb8ebdb/FLAG22dcf29d0 [2024-11-19 06:46:38,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e5a7027/439445e0263e4a97b2f8db64ceb8ebdb [2024-11-19 06:46:38,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:46:38,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:46:38,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:38,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:46:38,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:46:38,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5144be48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38, skipping insertion in model container [2024-11-19 06:46:38,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:46:38,581 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-19 06:46:38,614 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-19 06:46:38,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:38,632 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:46:38,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:46:38,658 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-19 06:46:38,670 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-19 06:46:38,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:38,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:46:38,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:46:38,752 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:46:38,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38 WrapperNode [2024-11-19 06:46:38,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:46:38,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:46:38,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:46:38,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:46:38,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,798 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 65 [2024-11-19 06:46:38,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:46:38,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:46:38,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:46:38,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:46:38,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,826 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-19 06:46:38,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:46:38,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:46:38,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:46:38,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:46:38,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (1/1) ... [2024-11-19 06:46:38,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:46:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:46:38,875 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-19 06:46:38,877 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-19 06:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:46:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-19 06:46:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-19 06:46:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-19 06:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-19 06:46:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-19 06:46:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:46:38,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:46:39,040 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:46:39,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:46:39,372 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-19 06:46:39,372 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:46:39,385 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:46:39,385 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:46:39,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:39 BoogieIcfgContainer [2024-11-19 06:46:39,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:46:39,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:46:39,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:46:39,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:46:39,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:46:38" (1/3) ... [2024-11-19 06:46:39,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52441a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:39, skipping insertion in model container [2024-11-19 06:46:39,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:38" (2/3) ... [2024-11-19 06:46:39,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52441a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:39, skipping insertion in model container [2024-11-19 06:46:39,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:39" (3/3) ... [2024-11-19 06:46:39,391 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2024-11-19 06:46:39,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:46:39,403 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-19 06:46:39,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:46:39,441 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;@129c9442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:46:39,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-19 06:46:39,444 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-19 06:46:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:46:39,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:39,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:39,454 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-19 06:46:39,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash -850861144, now seen corresponding path program 1 times [2024-11-19 06:46:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816728324] [2024-11-19 06:46:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:39,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:39,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:39,470 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-19 06:46:39,472 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-19 06:46:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:39,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:39,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:39,746 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:46:39,747 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-19 06:46:39,815 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-19 06:46:39,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:39,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:39,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816728324] [2024-11-19 06:46:39,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816728324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:39,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:39,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:46:39,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407416848] [2024-11-19 06:46:39,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:46:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:46:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2024-11-19 06:46:39,851 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-19 06:46:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:40,375 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2024-11-19 06:46:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:46:40,378 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-19 06:46:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:40,385 INFO L225 Difference]: With dead ends: 129 [2024-11-19 06:46:40,385 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 06:46:40,387 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-19 06:46:40,389 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 169 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:40,390 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.4s Time] [2024-11-19 06:46:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 06:46:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 84. [2024-11-19 06:46:40,422 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-19 06:46:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-19 06:46:40,424 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 12 [2024-11-19 06:46:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:40,424 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-19 06:46:40,424 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-19 06:46:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-19 06:46:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:46:40,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:40,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:40,429 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-19 06:46:40,629 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-19 06:46:40,630 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-19 06:46:40,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -850861143, now seen corresponding path program 1 times [2024-11-19 06:46:40,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:40,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020173177] [2024-11-19 06:46:40,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:40,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:40,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:40,634 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-19 06:46:40,635 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-19 06:46:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:40,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:46:40,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:40,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:40,880 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-19 06:46:40,973 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-19 06:46:40,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:40,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020173177] [2024-11-19 06:46:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020173177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:40,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:46:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192754244] [2024-11-19 06:46:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:40,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:46:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:46:40,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:46:40,977 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-19 06:46:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:41,538 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-11-19 06:46:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:46:41,538 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-19 06:46:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:41,539 INFO L225 Difference]: With dead ends: 123 [2024-11-19 06:46:41,539 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 06:46:41,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:46:41,540 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:41,541 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.4s Time] [2024-11-19 06:46:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 06:46:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 82. [2024-11-19 06:46:41,546 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-19 06:46:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2024-11-19 06:46:41,547 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 12 [2024-11-19 06:46:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:41,547 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2024-11-19 06:46:41,547 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-19 06:46:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2024-11-19 06:46:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:46:41,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:41,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:41,554 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-19 06:46:41,748 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-19 06:46:41,749 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-19 06:46:41,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 892712228, now seen corresponding path program 1 times [2024-11-19 06:46:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807952281] [2024-11-19 06:46:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:41,751 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-19 06:46:41,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:41,753 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-19 06:46:41,754 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-19 06:46:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:41,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:46:41,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:41,845 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-19 06:46:41,891 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-19 06:46:41,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:41,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807952281] [2024-11-19 06:46:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807952281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:46:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131193836] [2024-11-19 06:46:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:41,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:46:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:46:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:46:41,893 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-19 06:46:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:42,181 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2024-11-19 06:46:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:46:42,182 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-19 06:46:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:42,183 INFO L225 Difference]: With dead ends: 115 [2024-11-19 06:46:42,183 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:46:42,184 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-19 06:46:42,185 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:42,185 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.2s Time] [2024-11-19 06:46:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:46:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2024-11-19 06:46:42,191 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-19 06:46:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-19 06:46:42,192 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 15 [2024-11-19 06:46:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:42,192 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-19 06:46:42,192 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-19 06:46:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-19 06:46:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:46:42,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:42,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:42,196 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:42,393 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-19 06:46:42,394 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-19 06:46:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 892712229, now seen corresponding path program 1 times [2024-11-19 06:46:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876932955] [2024-11-19 06:46:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:42,395 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-19 06:46:42,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:42,398 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-19 06:46:42,399 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-19 06:46:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:42,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:46:42,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:46:42,605 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-19 06:46:42,933 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-19 06:46:42,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:42,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:42,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876932955] [2024-11-19 06:46:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876932955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:42,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:42,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:46:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128690269] [2024-11-19 06:46:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:42,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:46:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:42,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:46:42,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:46:42,936 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-19 06:46:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:43,923 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-19 06:46:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:46:43,924 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-19 06:46:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:43,925 INFO L225 Difference]: With dead ends: 111 [2024-11-19 06:46:43,925 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 06:46:43,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:46:43,926 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 122 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:43,927 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.6s Time] [2024-11-19 06:46:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 06:46:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-11-19 06:46:43,932 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-19 06:46:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2024-11-19 06:46:43,932 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 15 [2024-11-19 06:46:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:43,933 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2024-11-19 06:46:43,933 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-19 06:46:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2024-11-19 06:46:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:46:43,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:43,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:43,937 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 (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:44,136 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-19 06:46:44,137 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-19 06:46:44,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash -605397139, now seen corresponding path program 1 times [2024-11-19 06:46:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338415649] [2024-11-19 06:46:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:44,138 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-19 06:46:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:44,140 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-19 06:46:44,140 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-19 06:46:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:44,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:46:44,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:44,224 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-19 06:46:44,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:44,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:44,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338415649] [2024-11-19 06:46:44,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338415649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:44,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:44,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:46:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148533085] [2024-11-19 06:46:44,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:44,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:44,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:44,226 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-19 06:46:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:44,249 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-19 06:46:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:44,249 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-19 06:46:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:44,250 INFO L225 Difference]: With dead ends: 86 [2024-11-19 06:46:44,250 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 06:46:44,251 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-19 06:46:44,251 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-19 06:46:44,251 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-19 06:46:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 06:46:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-19 06:46:44,260 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-19 06:46:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-19 06:46:44,261 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2024-11-19 06:46:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:44,261 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-19 06:46:44,261 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-19 06:46:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-19 06:46:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:46:44,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:44,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:44,265 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-19 06:46:44,462 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-19 06:46:44,462 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-19 06:46:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1882115694, now seen corresponding path program 1 times [2024-11-19 06:46:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731834802] [2024-11-19 06:46:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:44,463 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-19 06:46:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:44,466 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-19 06:46:44,467 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-19 06:46:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:44,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:44,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:44,613 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-19 06:46:44,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:44,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731834802] [2024-11-19 06:46:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731834802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:46:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841178044] [2024-11-19 06:46:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:46:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:46:44,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:44,615 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-19 06:46:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:44,900 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2024-11-19 06:46:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:46:44,901 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-19 06:46:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:44,902 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:46:44,902 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:46:44,902 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-19 06:46:44,903 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-19 06:46:44,903 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-19 06:46:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:46:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2024-11-19 06:46:44,906 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-19 06:46:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-11-19 06:46:44,907 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 13 [2024-11-19 06:46:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:44,907 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-11-19 06:46:44,907 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-19 06:46:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-19 06:46:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:46:44,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:44,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:44,911 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-19 06:46:45,111 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-19 06:46:45,111 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-19 06:46:45,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1882115695, now seen corresponding path program 1 times [2024-11-19 06:46:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64537092] [2024-11-19 06:46:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:45,112 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-19 06:46:45,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:45,113 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-19 06:46:45,115 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-19 06:46:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:45,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:46:45,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:45,349 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-19 06:46:45,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:45,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64537092] [2024-11-19 06:46:45,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64537092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:45,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:46:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671114594] [2024-11-19 06:46:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:46:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:46:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:45,353 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-19 06:46:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:45,662 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-19 06:46:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:46:45,662 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-19 06:46:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:45,663 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:46:45,663 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:46:45,664 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-19 06:46:45,664 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-19 06:46:45,664 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-19 06:46:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:46:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2024-11-19 06:46:45,668 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-19 06:46:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2024-11-19 06:46:45,668 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 13 [2024-11-19 06:46:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:45,669 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2024-11-19 06:46:45,669 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-19 06:46:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2024-11-19 06:46:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:46:45,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:45,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:45,674 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:45,872 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-19 06:46:45,872 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-19 06:46:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1904275298, now seen corresponding path program 1 times [2024-11-19 06:46:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134763532] [2024-11-19 06:46:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:45,873 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-19 06:46:45,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:45,877 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-19 06:46:45,878 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-19 06:46:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:45,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:45,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:45,932 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-19 06:46:45,995 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-19 06:46:45,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:45,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:45,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134763532] [2024-11-19 06:46:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134763532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:45,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:45,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:46:45,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571593875] [2024-11-19 06:46:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:45,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:46:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:46:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:46:45,998 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-19 06:46:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:46,270 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2024-11-19 06:46:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:46:46,271 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-19 06:46:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:46,271 INFO L225 Difference]: With dead ends: 108 [2024-11-19 06:46:46,271 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:46:46,272 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-19 06:46:46,272 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:46,273 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.2s Time] [2024-11-19 06:46:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:46:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-11-19 06:46:46,276 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-19 06:46:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2024-11-19 06:46:46,277 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 16 [2024-11-19 06:46:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:46,277 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2024-11-19 06:46:46,277 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-19 06:46:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2024-11-19 06:46:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:46:46,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:46,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:46,284 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 (9)] Ended with exit code 0 [2024-11-19 06:46:46,481 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-19 06:46:46,482 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-19 06:46:46,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1904275299, now seen corresponding path program 1 times [2024-11-19 06:46:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507915115] [2024-11-19 06:46:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:46,483 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-19 06:46:46,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:46,486 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-19 06:46:46,488 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-19 06:46:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:46,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:46:46,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:46,557 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-19 06:46:46,669 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-19 06:46:46,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:46,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507915115] [2024-11-19 06:46:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507915115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:46:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65795216] [2024-11-19 06:46:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:46,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:46:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:46:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:46:46,671 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-19 06:46:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:47,042 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2024-11-19 06:46:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:46:47,043 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-19 06:46:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:47,043 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:46:47,043 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 06:46:47,044 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-19 06:46:47,044 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-19 06:46:47,044 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-19 06:46:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 06:46:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-11-19 06:46:47,048 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-19 06:46:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2024-11-19 06:46:47,048 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2024-11-19 06:46:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2024-11-19 06:46:47,049 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-19 06:46:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2024-11-19 06:46:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:46:47,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:47,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:46:47,055 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-19 06:46:47,250 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-19 06:46:47,250 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-19 06:46:47,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2033358017, now seen corresponding path program 1 times [2024-11-19 06:46:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587852158] [2024-11-19 06:46:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:47,251 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-19 06:46:47,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:47,253 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-19 06:46:47,254 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-19 06:46:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:47,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:46:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:47,340 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-19 06:46:47,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:47,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587852158] [2024-11-19 06:46:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587852158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:46:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25335904] [2024-11-19 06:46:47,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:47,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:47,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:47,348 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-19 06:46:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:47,361 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-11-19 06:46:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:47,365 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-19 06:46:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:47,366 INFO L225 Difference]: With dead ends: 86 [2024-11-19 06:46:47,366 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 06:46:47,366 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-19 06:46:47,366 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-19 06:46:47,367 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-19 06:46:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 06:46:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 06:46:47,369 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-19 06:46:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2024-11-19 06:46:47,373 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 16 [2024-11-19 06:46:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:47,374 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2024-11-19 06:46:47,374 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-19 06:46:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2024-11-19 06:46:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:46:47,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:47,382 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-19 06:46:47,385 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 (11)] Ended with exit code 0 [2024-11-19 06:46:47,582 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-19 06:46:47,582 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-19 06:46:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 352493573, now seen corresponding path program 1 times [2024-11-19 06:46:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370233496] [2024-11-19 06:46:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:47,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:47,587 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-19 06:46:47,587 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-19 06:46:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:47,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:46:47,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:47,668 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-19 06:46:47,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:47,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370233496] [2024-11-19 06:46:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370233496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:47,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:47,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:46:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162387613] [2024-11-19 06:46:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:46:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:46:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:46:47,670 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-19 06:46:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:47,760 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2024-11-19 06:46:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:46:47,761 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-19 06:46:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:47,762 INFO L225 Difference]: With dead ends: 85 [2024-11-19 06:46:47,762 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 06:46:47,762 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-19 06:46:47,764 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-19 06:46:47,764 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-19 06:46:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 06:46:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 06:46:47,769 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-19 06:46:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2024-11-19 06:46:47,773 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 18 [2024-11-19 06:46:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:47,773 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2024-11-19 06:46:47,773 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-19 06:46:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2024-11-19 06:46:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:46:47,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:47,774 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-19 06:46:47,780 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 (12)] Ended with exit code 0 [2024-11-19 06:46:47,974 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-19 06:46:47,975 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-19 06:46:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 352493574, now seen corresponding path program 1 times [2024-11-19 06:46:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23805233] [2024-11-19 06:46:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:47,976 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-19 06:46:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:47,977 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-19 06:46:47,978 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-19 06:46:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:48,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:46:48,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:48,141 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-19 06:46:48,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:48,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23805233] [2024-11-19 06:46:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23805233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:46:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456935033] [2024-11-19 06:46:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:46:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:46:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:46:48,144 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-19 06:46:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:48,303 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-11-19 06:46:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:46:48,303 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-19 06:46:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:48,304 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:46:48,304 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:46:48,304 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-19 06:46:48,305 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:48,305 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.1s Time] [2024-11-19 06:46:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:46:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 06:46:48,307 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-19 06:46:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-11-19 06:46:48,307 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 18 [2024-11-19 06:46:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:48,308 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-11-19 06:46:48,308 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-19 06:46:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-11-19 06:46:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:46:48,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:48,308 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-19 06:46:48,315 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-19 06:46:48,509 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-19 06:46:48,509 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-19 06:46:48,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1589206981, now seen corresponding path program 1 times [2024-11-19 06:46:48,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:48,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844597690] [2024-11-19 06:46:48,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:48,510 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-19 06:46:48,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:48,512 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-19 06:46:48,513 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-19 06:46:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:48,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:46:48,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:48,703 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-19 06:46:48,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:48,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844597690] [2024-11-19 06:46:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844597690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:48,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:46:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770601451] [2024-11-19 06:46:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:48,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:46:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:46:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:48,705 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-19 06:46:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:48,954 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2024-11-19 06:46:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:46:48,955 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-19 06:46:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:48,955 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:46:48,955 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:46:48,956 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-19 06:46:48,956 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-19 06:46:48,956 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-19 06:46:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:46:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2024-11-19 06:46:48,958 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-19 06:46:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-19 06:46:48,959 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 19 [2024-11-19 06:46:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:48,959 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-19 06:46:48,959 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-19 06:46:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-19 06:46:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:46:48,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:48,959 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-19 06:46:48,964 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 (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:49,160 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-19 06:46:49,160 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-19 06:46:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1589206982, now seen corresponding path program 1 times [2024-11-19 06:46:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:49,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52085803] [2024-11-19 06:46:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:49,161 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-19 06:46:49,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:49,163 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-19 06:46:49,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 (15)] Waiting until timeout for monitored process [2024-11-19 06:46:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:49,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:46:49,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:49,313 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-19 06:46:49,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:49,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52085803] [2024-11-19 06:46:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52085803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:46:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166695363] [2024-11-19 06:46:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:49,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:46:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:46:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:46:49,315 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-19 06:46:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:49,522 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2024-11-19 06:46:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:46:49,523 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-19 06:46:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:49,523 INFO L225 Difference]: With dead ends: 102 [2024-11-19 06:46:49,523 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 06:46:49,523 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-19 06:46:49,524 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-19 06:46:49,524 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-19 06:46:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 06:46:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-11-19 06:46:49,526 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-19 06:46:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-19 06:46:49,527 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 19 [2024-11-19 06:46:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:49,527 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-19 06:46:49,527 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-19 06:46:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-19 06:46:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:46:49,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:49,528 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-19 06:46:49,533 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-19 06:46:49,730 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-19 06:46:49,730 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-19 06:46:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1482879725, now seen corresponding path program 1 times [2024-11-19 06:46:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381864972] [2024-11-19 06:46:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:49,731 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-19 06:46:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:49,734 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-19 06:46:49,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 (16)] Waiting until timeout for monitored process [2024-11-19 06:46:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:49,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:46:49,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:49,832 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-19 06:46:49,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:49,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:49,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381864972] [2024-11-19 06:46:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381864972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:46:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486425472] [2024-11-19 06:46:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:49,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:46:49,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:46:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:46:49,834 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-19 06:46:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:49,938 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2024-11-19 06:46:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:46:49,938 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-19 06:46:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:49,939 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:46:49,939 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 06:46:49,939 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-19 06:46:49,940 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:49,940 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.1s Time] [2024-11-19 06:46:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 06:46:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 06:46:49,942 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-19 06:46:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-19 06:46:49,942 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 24 [2024-11-19 06:46:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:49,943 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-19 06:46:49,943 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-19 06:46:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-19 06:46:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:46:49,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:49,943 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-19 06:46:49,949 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-19 06:46:50,144 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-19 06:46:50,144 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-19 06:46:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1363387823, now seen corresponding path program 1 times [2024-11-19 06:46:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661483292] [2024-11-19 06:46:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:50,145 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-19 06:46:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:50,146 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-19 06:46:50,148 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-19 06:46:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:50,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 06:46:50,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:50,229 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-19 06:46:50,352 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-19 06:46:50,432 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-19 06:46:50,475 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-19 06:46:50,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:50,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661483292] [2024-11-19 06:46:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661483292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:46:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427400659] [2024-11-19 06:46:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:50,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:46:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:46:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:46:50,477 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-19 06:46:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:51,286 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2024-11-19 06:46:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:46:51,287 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-19 06:46:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:51,287 INFO L225 Difference]: With dead ends: 102 [2024-11-19 06:46:51,287 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 06:46:51,287 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-19 06:46:51,288 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 84 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-19 06:46:51,288 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-19 06:46:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 06:46:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2024-11-19 06:46:51,290 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-19 06:46:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-19 06:46:51,290 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 27 [2024-11-19 06:46:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:51,291 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-19 06:46:51,291 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-19 06:46:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-19 06:46:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:46:51,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:51,291 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-19 06:46:51,297 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 (17)] Ended with exit code 0 [2024-11-19 06:46:51,494 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-19 06:46:51,495 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-19 06:46:51,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1363387824, now seen corresponding path program 1 times [2024-11-19 06:46:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683262648] [2024-11-19 06:46:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:51,496 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-19 06:46:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:51,498 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-19 06:46:51,499 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-19 06:46:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:51,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 06:46:51,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:51,584 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-19 06:46:51,738 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-19 06:46:51,744 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-19 06:46:51,878 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-19 06:46:51,952 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-19 06:46:51,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:51,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683262648] [2024-11-19 06:46:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683262648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:46:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015688082] [2024-11-19 06:46:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:51,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:46:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:46:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:46:51,957 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-19 06:46:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:52,733 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-19 06:46:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:46:52,734 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-19 06:46:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:52,734 INFO L225 Difference]: With dead ends: 96 [2024-11-19 06:46:52,735 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 06:46:52,735 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-19 06:46:52,735 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:46:52,735 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.7s Time] [2024-11-19 06:46:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 06:46:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2024-11-19 06:46:52,737 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-19 06:46:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-19 06:46:52,738 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 27 [2024-11-19 06:46:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-19 06:46:52,738 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-19 06:46:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-19 06:46:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:46:52,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:52,739 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-19 06:46:52,749 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-19 06:46:52,939 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-19 06:46:52,940 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-19 06:46:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1119661157, now seen corresponding path program 1 times [2024-11-19 06:46:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954899342] [2024-11-19 06:46:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:52,941 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-19 06:46:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:52,943 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-19 06:46:52,944 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-19 06:46:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:53,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:46:53,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:53,031 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-19 06:46:53,138 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-19 06:46:53,218 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-19 06:46:53,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-19 06:46:53,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:53,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:53,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954899342] [2024-11-19 06:46:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954899342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 06:46:53,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549665803] [2024-11-19 06:46:53,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:53,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:46:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:46:53,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:46:53,325 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-19 06:46:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:54,251 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2024-11-19 06:46:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:46:54,251 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-19 06:46:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:54,252 INFO L225 Difference]: With dead ends: 103 [2024-11-19 06:46:54,252 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 06:46:54,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:46:54,253 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 101 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-19 06:46:54,253 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-19 06:46:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 06:46:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2024-11-19 06:46:54,255 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-19 06:46:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2024-11-19 06:46:54,255 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 32 [2024-11-19 06:46:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:54,255 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2024-11-19 06:46:54,255 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-19 06:46:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2024-11-19 06:46:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:46:54,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:54,256 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-19 06:46:54,262 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 (19)] Forceful destruction successful, exit code 0 [2024-11-19 06:46:54,456 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-19 06:46:54,457 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-19 06:46:54,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1119661156, now seen corresponding path program 1 times [2024-11-19 06:46:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896231299] [2024-11-19 06:46:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:54,458 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-19 06:46:54,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:54,460 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-19 06:46:54,462 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-19 06:46:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:54,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:46:54,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:54,551 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-19 06:46:54,723 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-19 06:46:54,728 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-19 06:46:54,845 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-19 06:46:54,975 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-19 06:46:54,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:54,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896231299] [2024-11-19 06:46:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896231299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:54,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:54,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 06:46:54,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007880275] [2024-11-19 06:46:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:46:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:46:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:46:54,977 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-19 06:46:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:55,783 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2024-11-19 06:46:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:46:55,784 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-19 06:46:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:55,785 INFO L225 Difference]: With dead ends: 97 [2024-11-19 06:46:55,785 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 06:46:55,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:46:55,785 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-19 06:46:55,785 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-19 06:46:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 06:46:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-11-19 06:46:55,787 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-19 06:46:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-19 06:46:55,792 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 32 [2024-11-19 06:46:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:55,792 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-19 06:46:55,792 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-19 06:46:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-19 06:46:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:46:55,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:55,793 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-19 06:46:55,797 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-19 06:46:55,993 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-19 06:46:55,994 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-19 06:46:55,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash -351927737, now seen corresponding path program 1 times [2024-11-19 06:46:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157216886] [2024-11-19 06:46:55,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:55,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:46:55,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:55,996 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-19 06:46:55,997 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-19 06:46:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:56,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:46:56,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:56,195 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-19 06:46:56,298 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-19 06:46:56,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:56,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157216886] [2024-11-19 06:46:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157216886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:56,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:56,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:46:56,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371081342] [2024-11-19 06:46:56,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:56,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:46:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:56,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:46:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:46:56,300 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-19 06:46:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:46:56,620 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-19 06:46:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:46:56,621 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-19 06:46:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:46:56,621 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:46:56,621 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:46:56,621 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-19 06:46:56,622 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 06:46:56,622 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-19 06:46:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:46:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-19 06:46:56,625 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-19 06:46:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-19 06:46:56,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2024-11-19 06:46:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:46:56,625 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-19 06:46:56,625 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-19 06:46:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-19 06:46:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:46:56,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:46:56,626 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-19 06:46:56,631 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 (21)] Ended with exit code 0 [2024-11-19 06:46:56,826 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-19 06:46:56,827 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-19 06:46:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:46:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1109518277, now seen corresponding path program 1 times [2024-11-19 06:46:56,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:46:56,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481571215] [2024-11-19 06:46:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:46:56,828 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-19 06:46:56,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:46:56,830 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-19 06:46:56,831 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-19 06:46:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:46:56,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:46:56,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:46:57,011 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:46:57,011 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-19 06:46:57,048 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-19 06:46:57,218 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-19 06:46:57,279 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-19 06:46:57,426 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-19 06:46:58,264 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-19 06:46:58,265 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-19 06:46:58,523 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-19 06:46:58,593 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-19 06:46:59,003 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-19 06:46:59,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:46:59,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:46:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481571215] [2024-11-19 06:46:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481571215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:46:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:46:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 06:46:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630126192] [2024-11-19 06:46:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:46:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:46:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:46:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:46:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:46:59,005 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-19 06:47:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:00,869 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2024-11-19 06:47:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 06:47:00,870 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-19 06:47:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:00,870 INFO L225 Difference]: With dead ends: 89 [2024-11-19 06:47:00,870 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 06:47:00,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 06:47:00,871 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 16 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:00,871 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.2s Time] [2024-11-19 06:47:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 06:47:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-19 06:47:00,873 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-19 06:47:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2024-11-19 06:47:00,873 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 35 [2024-11-19 06:47:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:00,873 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2024-11-19 06:47:00,873 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-19 06:47:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2024-11-19 06:47:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:47:00,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:00,874 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-19 06:47:00,878 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-19 06:47:01,074 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-19 06:47:01,074 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-19 06:47:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1109518276, now seen corresponding path program 1 times [2024-11-19 06:47:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523496394] [2024-11-19 06:47:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:01,075 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-19 06:47:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:01,078 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-19 06:47:01,079 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-19 06:47:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:01,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-19 06:47:01,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:01,306 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:01,307 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-19 06:47:01,653 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-19 06:47:01,670 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-19 06:47:01,762 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-19 06:47:01,783 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-19 06:47:01,919 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-19 06:47:01,919 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-19 06:47:01,985 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-19 06:47:01,985 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-19 06:47:03,401 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-19 06:47:03,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:03,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:03,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523496394] [2024-11-19 06:47:03,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523496394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:03,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-19 06:47:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912579435] [2024-11-19 06:47:03,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:03,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:47:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:03,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:47:03,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:47:03,404 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-19 06:47:08,532 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-19 06:47:12,925 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-19 06:47:16,949 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-19 06:47:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:17,469 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2024-11-19 06:47:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 06:47:17,470 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-19 06:47:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:17,471 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:47:17,471 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:47:17,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=161, Invalid=1321, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 06:47:17,472 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-19 06:47:17,472 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-19 06:47:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:47:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-19 06:47:17,474 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-19 06:47:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-19 06:47:17,474 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 35 [2024-11-19 06:47:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-19 06:47:17,474 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-19 06:47:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-19 06:47:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:47:17,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:17,475 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-19 06:47:17,480 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 (23)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:17,679 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-19 06:47:17,680 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-19 06:47:17,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash -35328223, now seen corresponding path program 1 times [2024-11-19 06:47:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:17,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847473337] [2024-11-19 06:47:17,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:17,681 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-19 06:47:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:17,683 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-19 06:47:17,684 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-19 06:47:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:17,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:47:17,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:17,851 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:17,852 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-19 06:47:18,012 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-19 06:47:18,067 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-19 06:47:18,067 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-19 06:47:18,071 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-19 06:47:18,298 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-19 06:47:18,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-19 06:47:18,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:18,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847473337] [2024-11-19 06:47:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847473337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:18,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-19 06:47:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478982093] [2024-11-19 06:47:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:18,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:47:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:47:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:47:18,603 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-19 06:47:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:20,728 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2024-11-19 06:47:20,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 06:47:20,729 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-19 06:47:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:20,729 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:47:20,729 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:47:20,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 06:47:20,730 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 146 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:20,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 219 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 936 Invalid, 5 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:47:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:47:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-19 06:47:20,732 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-19 06:47:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2024-11-19 06:47:20,732 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 36 [2024-11-19 06:47:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:20,732 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2024-11-19 06:47:20,733 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-19 06:47:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2024-11-19 06:47:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:47:20,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:20,733 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-19 06:47:20,742 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 (24)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:20,933 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-19 06:47:20,934 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-19 06:47:20,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -35328222, now seen corresponding path program 1 times [2024-11-19 06:47:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197988722] [2024-11-19 06:47:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:47:20,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:20,936 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-19 06:47:20,937 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-19 06:47:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:21,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:47:21,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:21,156 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:21,157 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-19 06:47:21,422 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-19 06:47:21,430 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-19 06:47:21,512 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-19 06:47:21,512 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-19 06:47:21,545 INFO L349 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2024-11-19 06:47:21,546 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-19 06:47:22,420 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-19 06:47:22,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:22,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197988722] [2024-11-19 06:47:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197988722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:22,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-19 06:47:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558591833] [2024-11-19 06:47:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:22,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:47:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:47:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:47:22,423 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-19 06:47:27,415 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-19 06:47:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:28,442 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2024-11-19 06:47:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 06:47:28,443 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-19 06:47:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:28,443 INFO L225 Difference]: With dead ends: 86 [2024-11-19 06:47:28,443 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 06:47:28,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 06:47:28,444 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 106 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:28,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 285 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 961 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-11-19 06:47:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 06:47:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-19 06:47:28,446 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-19 06:47:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2024-11-19 06:47:28,446 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 36 [2024-11-19 06:47:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:28,447 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2024-11-19 06:47:28,447 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-19 06:47:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2024-11-19 06:47:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:47:28,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:28,447 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-19 06:47:28,452 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-19 06:47:28,647 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-19 06:47:28,648 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-19 06:47:28,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash 522849360, now seen corresponding path program 1 times [2024-11-19 06:47:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:28,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624271993] [2024-11-19 06:47:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:28,649 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-19 06:47:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:28,650 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-19 06:47:28,652 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-19 06:47:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:28,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:47:28,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:28,968 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-19 06:47:29,111 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-19 06:47:29,274 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-19 06:47:29,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:29,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624271993] [2024-11-19 06:47:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624271993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:47:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496202058] [2024-11-19 06:47:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:47:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:47:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:47:29,276 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-19 06:47:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:30,003 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2024-11-19 06:47:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:47:30,004 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-19 06:47:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:30,004 INFO L225 Difference]: With dead ends: 85 [2024-11-19 06:47:30,004 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 06:47:30,005 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-19 06:47:30,005 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:30,006 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.6s Time] [2024-11-19 06:47:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 06:47:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 06:47:30,007 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-19 06:47:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2024-11-19 06:47:30,008 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 41 [2024-11-19 06:47:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:30,008 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2024-11-19 06:47:30,008 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-19 06:47:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2024-11-19 06:47:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:47:30,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:30,009 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-19 06:47:30,013 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-19 06:47:30,209 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-19 06:47:30,209 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-19 06:47:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1640982584, now seen corresponding path program 1 times [2024-11-19 06:47:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:30,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507372877] [2024-11-19 06:47:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:30,210 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-19 06:47:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:30,211 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-19 06:47:30,213 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-19 06:47:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:30,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 06:47:30,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:30,404 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:30,405 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-19 06:47:30,440 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-19 06:47:30,601 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-19 06:47:30,652 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-19 06:47:30,722 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-19 06:47:30,760 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-11-19 06:47:30,761 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-19 06:47:30,984 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-19 06:47:31,060 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-19 06:47:31,553 INFO L349 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2024-11-19 06:47:31,553 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-19 06:47:31,623 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-19 06:47:31,624 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-19 06:47:31,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-19 06:47:31,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:31,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507372877] [2024-11-19 06:47:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507372877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-19 06:47:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838343706] [2024-11-19 06:47:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:47:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:47:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:47:31,667 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-19 06:47:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:34,121 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2024-11-19 06:47:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 06:47:34,121 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-19 06:47:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:34,122 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:47:34,122 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:47:34,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=305, Invalid=2451, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 06:47:34,123 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 155 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 40 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:34,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 398 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1052 Invalid, 6 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 06:47:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:47:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2024-11-19 06:47:34,125 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-19 06:47:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2024-11-19 06:47:34,125 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 44 [2024-11-19 06:47:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:34,125 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2024-11-19 06:47:34,125 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-19 06:47:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2024-11-19 06:47:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:47:34,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:34,126 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-19 06:47:34,131 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-19 06:47:34,326 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-19 06:47:34,326 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-19 06:47:34,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1640982583, now seen corresponding path program 1 times [2024-11-19 06:47:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:34,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926174478] [2024-11-19 06:47:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:34,327 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-19 06:47:34,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:34,330 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-19 06:47:34,331 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-19 06:47:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:34,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 06:47:34,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:34,593 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:34,593 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-19 06:47:34,826 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-19 06:47:34,841 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-19 06:47:34,896 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-19 06:47:34,926 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-19 06:47:35,139 INFO L349 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2024-11-19 06:47:35,139 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-19 06:47:35,198 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-19 06:47:35,198 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-19 06:47:36,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-19 06:47:36,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:36,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926174478] [2024-11-19 06:47:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926174478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-19 06:47:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317313775] [2024-11-19 06:47:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:47:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:47:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:47:36,712 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-19 06:47:42,061 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-19 06:47:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:42,802 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2024-11-19 06:47:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 06:47:42,803 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-19 06:47:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:42,806 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:47:42,807 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:47:42,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=186, Invalid=1794, Unknown=0, NotChecked=0, Total=1980 [2024-11-19 06:47:42,807 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:42,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 495 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 916 Invalid, 3 Unknown, 0 Unchecked, 5.2s Time] [2024-11-19 06:47:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:47:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 06:47:42,811 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-19 06:47:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2024-11-19 06:47:42,812 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 44 [2024-11-19 06:47:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:42,813 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2024-11-19 06:47:42,813 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-19 06:47:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2024-11-19 06:47:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:47:42,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:42,814 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-19 06:47:42,819 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 (28)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:43,015 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-19 06:47:43,016 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-19 06:47:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -999377225, now seen corresponding path program 1 times [2024-11-19 06:47:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877047768] [2024-11-19 06:47:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:43,017 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-19 06:47:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:43,019 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-19 06:47:43,020 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-19 06:47:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:43,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:47:43,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:43,173 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-19 06:47:43,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:43,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877047768] [2024-11-19 06:47:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877047768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:47:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023420529] [2024-11-19 06:47:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:47:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:47:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:47:43,175 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-19 06:47:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:43,313 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2024-11-19 06:47:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:47:43,313 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-19 06:47:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:43,314 INFO L225 Difference]: With dead ends: 85 [2024-11-19 06:47:43,314 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 06:47:43,314 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-19 06:47:43,315 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-19 06:47:43,315 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-19 06:47:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 06:47:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 06:47:43,316 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-19 06:47:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2024-11-19 06:47:43,317 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 49 [2024-11-19 06:47:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:43,317 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2024-11-19 06:47:43,317 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-19 06:47:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2024-11-19 06:47:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:47:43,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:43,318 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-19 06:47:43,322 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 (29)] Ended with exit code 0 [2024-11-19 06:47:43,521 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-19 06:47:43,521 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-19 06:47:43,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -999377224, now seen corresponding path program 1 times [2024-11-19 06:47:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194652310] [2024-11-19 06:47:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:43,523 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-19 06:47:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:43,525 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-19 06:47:43,526 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-19 06:47:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:43,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:47:43,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:43,807 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-19 06:47:43,809 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-19 06:47:44,112 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-19 06:47:44,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:44,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:47:44,651 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-19 06:47:45,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:47:45,436 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-19 06:47:47,291 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-19 06:47:47,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194652310] [2024-11-19 06:47:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194652310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:47:47,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:47:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2024-11-19 06:47:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59309023] [2024-11-19 06:47:47,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:47:47,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:47:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:47:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:47:47,293 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) [2024-11-19 06:47:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:50,705 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2024-11-19 06:47:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:47:50,706 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 49 [2024-11-19 06:47:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:50,707 INFO L225 Difference]: With dead ends: 91 [2024-11-19 06:47:50,707 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 06:47:50,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 06:47:50,707 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:50,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 672 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 06:47:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 06:47:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-19 06:47:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.253968253968254) internal successors, (79), 77 states have internal predecessors, (79), 7 states have call successors, (7), 7 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-19 06:47:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2024-11-19 06:47:50,716 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 49 [2024-11-19 06:47:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:50,716 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2024-11-19 06:47:50,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-19 06:47:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2024-11-19 06:47:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:47:50,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:50,717 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:50,723 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 (30)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:50,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-19 06:47:50,918 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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-19 06:47:50,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash -918093142, now seen corresponding path program 1 times [2024-11-19 06:47:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151800956] [2024-11-19 06:47:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:50,919 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-19 06:47:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:50,920 INFO L229 MonitoredProcess]: Starting monitored process 31 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-19 06:47:50,922 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 (31)] Waiting until timeout for monitored process [2024-11-19 06:47:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:51,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:47:51,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:51,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:51,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151800956] [2024-11-19 06:47:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151800956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647135012] [2024-11-19 06:47:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:51,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:47:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:47:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:47:51,098 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-19 06:47:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:51,329 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2024-11-19 06:47:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:47:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 50 [2024-11-19 06:47:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:51,330 INFO L225 Difference]: With dead ends: 89 [2024-11-19 06:47:51,330 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 06:47:51,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:47:51,331 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 62 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:51,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 150 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 06:47:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 06:47:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 75 states have internal predecessors, (77), 7 states have call successors, (7), 7 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-19 06:47:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2024-11-19 06:47:51,333 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 50 [2024-11-19 06:47:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:51,334 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2024-11-19 06:47:51,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-19 06:47:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2024-11-19 06:47:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:47:51,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:51,334 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:51,339 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 (31)] Ended with exit code 0 [2024-11-19 06:47:51,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-19 06:47:51,535 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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-19 06:47:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -918093141, now seen corresponding path program 1 times [2024-11-19 06:47:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17579151] [2024-11-19 06:47:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:51,536 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-19 06:47:51,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:51,537 INFO L229 MonitoredProcess]: Starting monitored process 32 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-19 06:47:51,539 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 (32)] Waiting until timeout for monitored process [2024-11-19 06:47:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:51,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:47:51,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:47:51,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:51,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17579151] [2024-11-19 06:47:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17579151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:51,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:51,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:47:51,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299040890] [2024-11-19 06:47:51,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:51,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:47:51,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:51,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:47:51,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:47:51,846 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:47:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:52,102 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2024-11-19 06:47:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:47:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2024-11-19 06:47:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:52,103 INFO L225 Difference]: With dead ends: 88 [2024-11-19 06:47:52,103 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 06:47:52,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:47:52,103 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:52,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 171 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:47:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 06:47:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 06:47:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 74 states have internal predecessors, (76), 7 states have call successors, (7), 7 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-19 06:47:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2024-11-19 06:47:52,106 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 50 [2024-11-19 06:47:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:52,106 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2024-11-19 06:47:52,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:47:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2024-11-19 06:47:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:47:52,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:52,108 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:52,114 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 (32)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:52,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-19 06:47:52,313 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-19 06:47:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1603883652, now seen corresponding path program 1 times [2024-11-19 06:47:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010936836] [2024-11-19 06:47:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:52,314 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-19 06:47:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:52,319 INFO L229 MonitoredProcess]: Starting monitored process 33 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-19 06:47:52,321 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 (33)] Waiting until timeout for monitored process [2024-11-19 06:47:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:52,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:47:52,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:52,554 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-19 06:47:52,558 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-19 06:47:52,723 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-19 06:47:52,725 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-19 06:47:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:47:52,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:47:52,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:52,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010936836] [2024-11-19 06:47:52,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010936836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:47:52,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:47:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:47:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411015420] [2024-11-19 06:47:52,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:47:52,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:47:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:47:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:47:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:47:52,857 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:47:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:47:53,426 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-19 06:47:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:47:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2024-11-19 06:47:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:47:53,428 INFO L225 Difference]: With dead ends: 87 [2024-11-19 06:47:53,428 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 06:47:53,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:47:53,428 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:47:53,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 262 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:47:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 06:47:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 06:47:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 73 states have internal predecessors, (75), 7 states have call successors, (7), 7 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-19 06:47:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2024-11-19 06:47:53,431 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 51 [2024-11-19 06:47:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:47:53,431 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2024-11-19 06:47:53,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:47:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2024-11-19 06:47:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:47:53,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:47:53,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:47:53,439 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 (33)] Forceful destruction successful, exit code 0 [2024-11-19 06:47:53,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-19 06:47:53,633 INFO L396 AbstractCegarLoop]: === Iteration 33 === 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-19 06:47:53,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:47:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash 266375071, now seen corresponding path program 1 times [2024-11-19 06:47:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:47:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288717277] [2024-11-19 06:47:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:53,634 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-19 06:47:53,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:47:53,635 INFO L229 MonitoredProcess]: Starting monitored process 34 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-19 06:47:53,636 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 (34)] Waiting until timeout for monitored process [2024-11-19 06:47:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:53,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 06:47:53,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:53,913 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:47:53,913 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 13 [2024-11-19 06:47:53,930 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:53,931 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-19 06:47:54,203 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-19 06:47:54,270 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-19 06:47:54,384 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-19 06:47:54,384 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 06:47:54,406 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-19 06:47:54,726 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-19 06:47:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:55,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:47:56,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:47:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288717277] [2024-11-19 06:47:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288717277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:47:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1780191156] [2024-11-19 06:47:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:47:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:47:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:47:56,129 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:47:56,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-19 06:47:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:47:56,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-19 06:47:56,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:47:56,768 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:47:56,768 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-19 06:47:57,357 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-19 06:47:57,367 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-19 06:47:57,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:57,488 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-19 06:47:57,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:57,500 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-19 06:47:57,691 INFO L349 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2024-11-19 06:47:57,692 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 28 treesize of output 48 [2024-11-19 06:47:57,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:47:57,756 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-11-19 06:47:57,756 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 28 treesize of output 38 [2024-11-19 06:47:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:47:59,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:04,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:04,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 11390 treesize of output 11095 [2024-11-19 06:48:05,166 INFO L349 Elim1Store]: treesize reduction 207, result has 36.3 percent of original size [2024-11-19 06:48:05,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 8010 treesize of output 7925 [2024-11-19 06:48:05,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:48:05,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3132 treesize of output 3196 [2024-11-19 06:48:12,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4