./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:29:26,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:29:26,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:29:26,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:29:26,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:29:26,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:29:26,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:29:26,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:29:26,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:29:26,582 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:29:26,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:29:26,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:29:26,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:29:26,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:29:26,584 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:29:26,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:29:26,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:29:26,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:29:26,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:29:26,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:29:26,591 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:29:26,591 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:29:26,591 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:29:26,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:29:26,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:29:26,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:29:26,592 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:29:26,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:29:26,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:29:26,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:29:26,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:29:26,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:29:26,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:29:26,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:26,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:29:26,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:29:26,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:29:26,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:29:26,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:29:26,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:29:26,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:29:26,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:29:26,598 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2024-10-24 16:29:26,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:29:26,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:29:26,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:29:26,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:29:26,882 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:29:26,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-24 16:29:28,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:29:28,544 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:29:28,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-24 16:29:28,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b53cc6f/10ff60258fab4348a02e6e847c6029b7/FLAGc31814a6e [2024-10-24 16:29:28,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14b53cc6f/10ff60258fab4348a02e6e847c6029b7 [2024-10-24 16:29:28,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:29:28,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:29:28,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:28,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:29:28,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:29:28,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:28" (1/1) ... [2024-10-24 16:29:28,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0c830a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:28, skipping insertion in model container [2024-10-24 16:29:28,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:28" (1/1) ... [2024-10-24 16:29:28,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:29:29,366 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-10-24 16:29:29,367 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-10-24 16:29:29,367 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-10-24 16:29:29,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:29,409 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-10-24 16:29:29,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70de01f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:29, skipping insertion in model container [2024-10-24 16:29:29,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:29,411 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:29:29,413 INFO L158 Benchmark]: Toolchain (without parser) took 547.57ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 92.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:29:29,414 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 165.7MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:29:29,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.74ms. Allocated memory is still 165.7MB. Free memory was 108.8MB in the beginning and 92.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:29:29,416 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.20ms. Allocated memory is still 165.7MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.74ms. Allocated memory is still 165.7MB. Free memory was 108.8MB in the beginning and 92.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:29:31,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:29:31,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:29:31,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:29:31,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:29:31,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:29:31,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:29:31,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:29:31,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:29:31,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:29:31,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:29:31,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:29:31,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:29:31,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:29:31,513 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:29:31,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:29:31,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:29:31,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:29:31,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:29:31,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:29:31,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:29:31,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:29:31,519 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:29:31,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:29:31,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:29:31,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:29:31,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:29:31,520 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:29:31,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:29:31,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:29:31,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:29:31,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:29:31,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:29:31,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:29:31,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:29:31,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:31,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:29:31,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:29:31,524 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:29:31,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:29:31,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:29:31,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:29:31,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:29:31,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:29:31,526 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:29:31,527 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2024-10-24 16:29:31,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:29:31,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:29:31,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:29:31,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:29:31,870 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:29:31,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-24 16:29:33,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:29:33,748 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:29:33,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2024-10-24 16:29:33,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454ce781/2a4b852aabe94454b34d466c94aab822/FLAG8a1fb69f7 [2024-10-24 16:29:34,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454ce781/2a4b852aabe94454b34d466c94aab822 [2024-10-24 16:29:34,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:29:34,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:29:34,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:34,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:29:34,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:29:34,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aafee50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34, skipping insertion in model container [2024-10-24 16:29:34,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:29:34,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:34,608 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:29:34,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:29:34,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:34,686 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:29:34,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:29:34,830 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:29:34,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34 WrapperNode [2024-10-24 16:29:34,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:29:34,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:29:34,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:29:34,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:29:34,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,894 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 123 [2024-10-24 16:29:34,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:29:34,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:29:34,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:29:34,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:29:34,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,959 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-10-24 16:29:34,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:34,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:35,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:29:35,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:29:35,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:29:35,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:29:35,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (1/1) ... [2024-10-24 16:29:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:29:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:35,036 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-10-24 16:29:35,040 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-10-24 16:29:35,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-10-24 16:29:35,073 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 16:29:35,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:29:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:29:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 16:29:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 16:29:35,074 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-10-24 16:29:35,074 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-10-24 16:29:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-24 16:29:35,075 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-24 16:29:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:29:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:29:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:29:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:29:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-24 16:29:35,076 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-24 16:29:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:29:35,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:29:35,240 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:29:35,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:29:35,960 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-10-24 16:29:35,961 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:29:36,024 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:29:36,024 INFO L314 CfgBuilder]: Removed 41 assume(true) statements. [2024-10-24 16:29:36,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:36 BoogieIcfgContainer [2024-10-24 16:29:36,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:29:36,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:29:36,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:29:36,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:29:36,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:29:34" (1/3) ... [2024-10-24 16:29:36,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478e8851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:36, skipping insertion in model container [2024-10-24 16:29:36,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:29:34" (2/3) ... [2024-10-24 16:29:36,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478e8851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:29:36, skipping insertion in model container [2024-10-24 16:29:36,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:29:36" (3/3) ... [2024-10-24 16:29:36,033 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2024-10-24 16:29:36,047 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:29:36,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2024-10-24 16:29:36,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:29:36,109 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;@40913b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:29:36,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-24 16:29:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 102 states have (on average 2.343137254901961) internal successors, (239), 191 states have internal predecessors, (239), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 16:29:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:29:36,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:36,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:29:36,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 18699899, now seen corresponding path program 1 times [2024-10-24 16:29:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:36,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438627351] [2024-10-24 16:29:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:36,141 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-10-24 16:29:36,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:36,145 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-10-24 16:29:36,147 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-10-24 16:29:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 16:29:36,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:36,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:36,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:36,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438627351] [2024-10-24 16:29:36,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438627351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:36,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:36,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539803767] [2024-10-24 16:29:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:36,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 16:29:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 16:29:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:29:36,280 INFO L87 Difference]: Start difference. First operand has 201 states, 102 states have (on average 2.343137254901961) internal successors, (239), 191 states have internal predecessors, (239), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:36,361 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2024-10-24 16:29:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 16:29:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:29:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:36,374 INFO L225 Difference]: With dead ends: 197 [2024-10-24 16:29:36,375 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 16:29:36,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:29:36,380 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 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-10-24 16:29:36,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:29:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 16:29:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-24 16:29:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 101 states have (on average 1.891089108910891) internal successors, (191), 185 states have internal predecessors, (191), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2024-10-24 16:29:36,424 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 4 [2024-10-24 16:29:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:36,425 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2024-10-24 16:29:36,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2024-10-24 16:29:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:29:36,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:36,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:29:36,432 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-10-24 16:29:36,628 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-10-24 16:29:36,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 18699961, now seen corresponding path program 1 times [2024-10-24 16:29:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:36,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712693228] [2024-10-24 16:29:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:36,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-10-24 16:29:36,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:36,632 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-10-24 16:29:36,653 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-10-24 16:29:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:36,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:29:36,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:36,757 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-10-24 16:29:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:36,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:36,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712693228] [2024-10-24 16:29:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712693228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:36,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:36,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592365769] [2024-10-24 16:29:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:36,777 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:36,991 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2024-10-24 16:29:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:36,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:29:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:36,993 INFO L225 Difference]: With dead ends: 193 [2024-10-24 16:29:36,994 INFO L226 Difference]: Without dead ends: 193 [2024-10-24 16:29:36,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:36,995 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:36,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 331 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-24 16:29:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-24 16:29:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 101 states have (on average 1.8613861386138615) internal successors, (188), 182 states have internal predecessors, (188), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2024-10-24 16:29:37,014 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 4 [2024-10-24 16:29:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:37,014 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2024-10-24 16:29:37,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2024-10-24 16:29:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:29:37,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:37,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:29:37,021 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-10-24 16:29:37,215 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-10-24 16:29:37,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:37,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash 18699962, now seen corresponding path program 1 times [2024-10-24 16:29:37,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:37,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934746169] [2024-10-24 16:29:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:37,217 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-10-24 16:29:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:37,220 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-10-24 16:29:37,222 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-10-24 16:29:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:37,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:29:37,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:37,289 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-10-24 16:29:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:37,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:37,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934746169] [2024-10-24 16:29:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934746169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096435197] [2024-10-24 16:29:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:37,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:37,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:37,308 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:37,528 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2024-10-24 16:29:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:29:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:37,530 INFO L225 Difference]: With dead ends: 190 [2024-10-24 16:29:37,530 INFO L226 Difference]: Without dead ends: 190 [2024-10-24 16:29:37,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:37,532 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:37,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 334 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-24 16:29:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-24 16:29:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 101 states have (on average 1.8316831683168318) internal successors, (185), 179 states have internal predecessors, (185), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2024-10-24 16:29:37,554 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 4 [2024-10-24 16:29:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:37,554 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2024-10-24 16:29:37,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2024-10-24 16:29:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:29:37,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:37,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:37,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 16:29:37,755 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-10-24 16:29:37,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1254693481, now seen corresponding path program 1 times [2024-10-24 16:29:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:37,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724234244] [2024-10-24 16:29:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:37,757 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-10-24 16:29:37,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:37,760 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-10-24 16:29:37,761 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-10-24 16:29:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:37,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:29:37,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:37,895 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:29:37,895 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-10-24 16:29:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:37,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:37,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724234244] [2024-10-24 16:29:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724234244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:29:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496368714] [2024-10-24 16:29:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:29:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:29:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:29:37,960 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:38,414 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2024-10-24 16:29:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:29:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:29:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:38,417 INFO L225 Difference]: With dead ends: 222 [2024-10-24 16:29:38,417 INFO L226 Difference]: Without dead ends: 222 [2024-10-24 16:29:38,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:38,418 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 233 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:38,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 351 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:29:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-24 16:29:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 200. [2024-10-24 16:29:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 111 states have (on average 1.8738738738738738) internal successors, (208), 188 states have internal predecessors, (208), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2024-10-24 16:29:38,438 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 7 [2024-10-24 16:29:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2024-10-24 16:29:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2024-10-24 16:29:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:29:38,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:38,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:38,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 16:29:38,644 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-10-24 16:29:38,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1254693480, now seen corresponding path program 1 times [2024-10-24 16:29:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895363621] [2024-10-24 16:29:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:38,646 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-10-24 16:29:38,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:38,649 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-10-24 16:29:38,650 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-10-24 16:29:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:38,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:29:38,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:38,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:38,809 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-10-24 16:29:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:38,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:38,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895363621] [2024-10-24 16:29:38,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895363621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:38,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107467187] [2024-10-24 16:29:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:38,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:38,927 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:39,490 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2024-10-24 16:29:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:39,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:29:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:39,492 INFO L225 Difference]: With dead ends: 204 [2024-10-24 16:29:39,492 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 16:29:39,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:39,493 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 421 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:39,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 264 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:29:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 16:29:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2024-10-24 16:29:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 108 states have (on average 1.8055555555555556) internal successors, (195), 181 states have internal predecessors, (195), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:29:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 222 transitions. [2024-10-24 16:29:39,503 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 222 transitions. Word has length 7 [2024-10-24 16:29:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:39,503 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 222 transitions. [2024-10-24 16:29:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 222 transitions. [2024-10-24 16:29:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:29:39,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:39,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:39,509 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-10-24 16:29:39,704 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-10-24 16:29:39,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash -240785128, now seen corresponding path program 1 times [2024-10-24 16:29:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209833296] [2024-10-24 16:29:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:39,706 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-10-24 16:29:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:39,708 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-10-24 16:29:39,709 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-10-24 16:29:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:39,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:29:39,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:39,866 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-24 16:29:39,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-10-24 16:29:39,914 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 16 treesize of output 11 [2024-10-24 16:29:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:39,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:39,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:39,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209833296] [2024-10-24 16:29:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209833296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:39,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:29:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319291443] [2024-10-24 16:29:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:39,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:29:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:39,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:29:39,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:39,995 INFO L87 Difference]: Start difference. First operand 193 states and 222 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:40,480 INFO L93 Difference]: Finished difference Result 204 states and 234 transitions. [2024-10-24 16:29:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:29:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 16:29:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:40,483 INFO L225 Difference]: With dead ends: 204 [2024-10-24 16:29:40,483 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 16:29:40,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:29:40,484 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1095 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:29:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 16:29:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2024-10-24 16:29:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 187 states have internal predecessors, (202), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 231 transitions. [2024-10-24 16:29:40,490 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 231 transitions. Word has length 8 [2024-10-24 16:29:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:40,490 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 231 transitions. [2024-10-24 16:29:40,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2024-10-24 16:29:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:29:40,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:40,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:40,497 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-10-24 16:29:40,692 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-10-24 16:29:40,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:40,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash -240785127, now seen corresponding path program 1 times [2024-10-24 16:29:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834149455] [2024-10-24 16:29:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:40,693 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-10-24 16:29:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:40,695 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-10-24 16:29:40,696 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-10-24 16:29:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:40,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:29:40,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:40,858 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:29:40,859 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-10-24 16:29:40,877 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:29:40,877 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-10-24 16:29:40,949 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 16 treesize of output 11 [2024-10-24 16:29:40,956 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 16 treesize of output 11 [2024-10-24 16:29:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:41,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:41,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:41,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834149455] [2024-10-24 16:29:41,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834149455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:41,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:41,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:29:41,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688817450] [2024-10-24 16:29:41,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:41,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:29:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:29:41,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:41,087 INFO L87 Difference]: Start difference. First operand 200 states and 231 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:41,805 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2024-10-24 16:29:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:29:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 16:29:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:41,807 INFO L225 Difference]: With dead ends: 206 [2024-10-24 16:29:41,807 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 16:29:41,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:29:41,808 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 16 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:41,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 960 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:29:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 16:29:41,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2024-10-24 16:29:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 114 states have (on average 1.763157894736842) internal successors, (201), 187 states have internal predecessors, (201), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2024-10-24 16:29:41,815 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 8 [2024-10-24 16:29:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:41,816 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2024-10-24 16:29:41,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2024-10-24 16:29:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:41,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:41,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:41,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 16:29:42,017 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-10-24 16:29:42,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1125595957, now seen corresponding path program 1 times [2024-10-24 16:29:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590123653] [2024-10-24 16:29:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:42,019 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-10-24 16:29:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:42,020 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-10-24 16:29:42,021 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-10-24 16:29:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:42,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:29:42,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:42,100 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-10-24 16:29:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:42,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:42,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:42,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590123653] [2024-10-24 16:29:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590123653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:42,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:42,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589217025] [2024-10-24 16:29:42,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:42,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:42,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:42,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:42,137 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:42,497 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2024-10-24 16:29:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:29:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 16:29:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:42,499 INFO L225 Difference]: With dead ends: 205 [2024-10-24 16:29:42,499 INFO L226 Difference]: Without dead ends: 205 [2024-10-24 16:29:42,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:42,499 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 24 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:42,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 708 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:29:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-24 16:29:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2024-10-24 16:29:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 114 states have (on average 1.736842105263158) internal successors, (198), 186 states have internal predecessors, (198), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2024-10-24 16:29:42,508 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 9 [2024-10-24 16:29:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:42,508 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2024-10-24 16:29:42,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2024-10-24 16:29:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:29:42,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:42,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:42,514 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-10-24 16:29:42,710 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-10-24 16:29:42,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1125595958, now seen corresponding path program 1 times [2024-10-24 16:29:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240902893] [2024-10-24 16:29:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:42,711 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-10-24 16:29:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:42,717 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-10-24 16:29:42,718 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-10-24 16:29:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:42,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:29:42,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:42,789 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-10-24 16:29:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:42,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:42,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240902893] [2024-10-24 16:29:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240902893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:29:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834098335] [2024-10-24 16:29:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:42,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:42,850 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:43,248 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2024-10-24 16:29:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 16:29:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:43,250 INFO L225 Difference]: With dead ends: 203 [2024-10-24 16:29:43,250 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 16:29:43,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:43,253 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 19 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:43,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 729 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:29:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 16:29:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2024-10-24 16:29:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 114 states have (on average 1.719298245614035) internal successors, (196), 186 states have internal predecessors, (196), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2024-10-24 16:29:43,260 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 9 [2024-10-24 16:29:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:43,260 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2024-10-24 16:29:43,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2024-10-24 16:29:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:29:43,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:43,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:43,266 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 (10)] Ended with exit code 0 [2024-10-24 16:29:43,462 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-10-24 16:29:43,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -634033160, now seen corresponding path program 1 times [2024-10-24 16:29:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805111908] [2024-10-24 16:29:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:43,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-10-24 16:29:43,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:43,466 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-10-24 16:29:43,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 (11)] Waiting until timeout for monitored process [2024-10-24 16:29:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:43,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:29:43,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:43,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:43,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805111908] [2024-10-24 16:29:43,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805111908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:43,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:43,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:29:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882673667] [2024-10-24 16:29:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:43,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:29:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:43,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:29:43,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:43,573 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:43,726 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2024-10-24 16:29:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:29:43,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 16:29:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:43,727 INFO L225 Difference]: With dead ends: 198 [2024-10-24 16:29:43,728 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 16:29:43,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:29:43,728 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:43,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 319 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 16:29:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-24 16:29:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.7017543859649122) internal successors, (194), 185 states have internal predecessors, (194), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2024-10-24 16:29:43,734 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 11 [2024-10-24 16:29:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:43,734 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2024-10-24 16:29:43,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2024-10-24 16:29:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:29:43,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:43,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:43,739 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-10-24 16:29:43,938 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-10-24 16:29:43,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash -634033159, now seen corresponding path program 1 times [2024-10-24 16:29:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:43,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72222306] [2024-10-24 16:29:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:43,940 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-10-24 16:29:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:43,941 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-10-24 16:29:43,942 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-10-24 16:29:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:44,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:29:44,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:44,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:44,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72222306] [2024-10-24 16:29:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72222306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:29:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920897222] [2024-10-24 16:29:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:44,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:29:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:44,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:29:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:29:44,075 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:44,318 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2024-10-24 16:29:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:29:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 16:29:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:44,319 INFO L225 Difference]: With dead ends: 200 [2024-10-24 16:29:44,320 INFO L226 Difference]: Without dead ends: 200 [2024-10-24 16:29:44,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:29:44,320 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 218 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:44,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 660 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-24 16:29:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-10-24 16:29:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 185 states have internal predecessors, (193), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2024-10-24 16:29:44,326 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 11 [2024-10-24 16:29:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:44,326 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2024-10-24 16:29:44,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:29:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2024-10-24 16:29:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:29:44,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:44,327 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] [2024-10-24 16:29:44,332 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-10-24 16:29:44,527 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-10-24 16:29:44,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting inspectErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1792420794, now seen corresponding path program 1 times [2024-10-24 16:29:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93941979] [2024-10-24 16:29:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:44,528 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-10-24 16:29:44,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:44,530 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-10-24 16:29:44,530 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-10-24 16:29:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:44,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:29:44,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:44,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:44,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93941979] [2024-10-24 16:29:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93941979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:29:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789699638] [2024-10-24 16:29:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:44,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:29:44,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:29:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:44,698 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-10-24 16:29:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:45,171 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2024-10-24 16:29:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:29:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2024-10-24 16:29:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:45,172 INFO L225 Difference]: With dead ends: 193 [2024-10-24 16:29:45,172 INFO L226 Difference]: Without dead ends: 193 [2024-10-24 16:29:45,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:29:45,173 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 343 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:45,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 366 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:29:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-24 16:29:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-24 16:29:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 114 states have (on average 1.6491228070175439) internal successors, (188), 180 states have internal predecessors, (188), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2024-10-24 16:29:45,181 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 23 [2024-10-24 16:29:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:45,182 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2024-10-24 16:29:45,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-10-24 16:29:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2024-10-24 16:29:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:29:45,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:45,183 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] [2024-10-24 16:29:45,188 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-10-24 16:29:45,384 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-10-24 16:29:45,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1792420795, now seen corresponding path program 1 times [2024-10-24 16:29:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889054690] [2024-10-24 16:29:45,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:45,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:29:45,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:45,386 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-10-24 16:29:45,387 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-10-24 16:29:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:45,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:29:45,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:45,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:45,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:45,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889054690] [2024-10-24 16:29:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889054690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:45,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:45,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:29:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612311934] [2024-10-24 16:29:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:45,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:29:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:29:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:45,646 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-10-24 16:29:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:46,220 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2024-10-24 16:29:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:29:46,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2024-10-24 16:29:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:46,221 INFO L225 Difference]: With dead ends: 192 [2024-10-24 16:29:46,221 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 16:29:46,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:29:46,222 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 439 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:46,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 417 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:29:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 16:29:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-24 16:29:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 114 states have (on average 1.6403508771929824) internal successors, (187), 179 states have internal predecessors, (187), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:29:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2024-10-24 16:29:46,227 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 23 [2024-10-24 16:29:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:46,228 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2024-10-24 16:29:46,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-10-24 16:29:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2024-10-24 16:29:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:29:46,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:46,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:46,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 16:29:46,429 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-10-24 16:29:46,430 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1630883233, now seen corresponding path program 1 times [2024-10-24 16:29:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293578169] [2024-10-24 16:29:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:46,431 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-10-24 16:29:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:46,434 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-10-24 16:29:46,435 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-10-24 16:29:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:46,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:29:46,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:46,652 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 16:29:46,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-24 16:29:46,951 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-10-24 16:29:47,092 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 16 treesize of output 11 [2024-10-24 16:29:47,123 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:29:47,124 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 36 treesize of output 35 [2024-10-24 16:29:47,312 INFO L349 Elim1Store]: treesize reduction 92, result has 31.3 percent of original size [2024-10-24 16:29:47,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 67 [2024-10-24 16:29:47,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-24 16:29:47,775 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 35 treesize of output 19 [2024-10-24 16:29:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:47,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:47,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_383) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2024-10-24 16:29:48,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:29:48,169 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-24 16:29:48,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:29:48,177 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 36 [2024-10-24 16:29:48,183 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 16 treesize of output 14 [2024-10-24 16:29:48,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293578169] [2024-10-24 16:29:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293578169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [52788324] [2024-10-24 16:29:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:29:48,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:29:48,344 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:29:48,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-24 16:29:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:48,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:29:48,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:48,749 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-10-24 16:29:48,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2024-10-24 16:29:49,291 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-10-24 16:29:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:29:49,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:29:49,508 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 44 treesize of output 41 [2024-10-24 16:29:49,770 INFO L349 Elim1Store]: treesize reduction 122, result has 30.3 percent of original size [2024-10-24 16:29:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 76 [2024-10-24 16:29:49,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2024-10-24 16:29:50,148 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 35 treesize of output 19 [2024-10-24 16:29:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:50,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:50,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (_ BitVec 1)) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_23| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_23| v_ArrVal_461) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_460) |v_ULTIMATE.start_gl_insert_~node~1#1.base_23| v_ArrVal_462) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) is different from false [2024-10-24 16:29:50,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:29:50,452 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-24 16:29:50,454 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:29:50,456 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 36 [2024-10-24 16:29:50,460 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 16 treesize of output 14 [2024-10-24 16:29:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [52788324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:54,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:29:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2024-10-24 16:29:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002216304] [2024-10-24 16:29:54,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:54,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-24 16:29:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-24 16:29:54,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1106, Unknown=38, NotChecked=142, Total=1482 [2024-10-24 16:29:54,660 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand has 27 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:29:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:57,686 INFO L93 Difference]: Finished difference Result 346 states and 387 transitions. [2024-10-24 16:29:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:29:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-10-24 16:29:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:57,688 INFO L225 Difference]: With dead ends: 346 [2024-10-24 16:29:57,688 INFO L226 Difference]: Without dead ends: 346 [2024-10-24 16:29:57,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=292, Invalid=1400, Unknown=38, NotChecked=162, Total=1892 [2024-10-24 16:29:57,690 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 760 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:57,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1849 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 16:29:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-24 16:29:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 263. [2024-10-24 16:29:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 180 states have (on average 1.6611111111111112) internal successors, (299), 246 states have internal predecessors, (299), 25 states have call successors, (25), 8 states have call predecessors, (25), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 16:29:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 334 transitions. [2024-10-24 16:29:57,701 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 334 transitions. Word has length 24 [2024-10-24 16:29:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 334 transitions. [2024-10-24 16:29:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:29:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 334 transitions. [2024-10-24 16:29:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:29:57,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:57,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:57,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:57,911 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-10-24 16:29:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-24 16:29:58,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:29:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1630883232, now seen corresponding path program 1 times [2024-10-24 16:29:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:29:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397830638] [2024-10-24 16:29:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:58,107 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-10-24 16:29:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:29:58,110 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-10-24 16:29:58,111 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-10-24 16:29:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:58,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-24 16:29:58,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:58,335 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:29:58,335 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-10-24 16:29:58,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:29:58,591 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-10-24 16:29:58,606 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-10-24 16:29:58,712 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 16 treesize of output 11 [2024-10-24 16:29:58,717 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 16 treesize of output 11 [2024-10-24 16:29:58,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:29:58,747 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 50 treesize of output 45 [2024-10-24 16:29:58,753 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 24 treesize of output 11 [2024-10-24 16:29:58,897 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:29:58,898 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-10-24 16:29:58,933 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-10-24 16:29:58,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2024-10-24 16:29:59,032 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 26 treesize of output 19 [2024-10-24 16:29:59,040 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 16 treesize of output 11 [2024-10-24 16:29:59,203 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 13 [2024-10-24 16:29:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:59,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:59,409 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_544) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_544) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_545) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2024-10-24 16:29:59,452 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_27|))) (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_27| v_ArrVal_544) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_27| (_ bv20 32)) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_27| v_ArrVal_545) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_27| (_ BitVec 32))) (or (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_27| v_ArrVal_544) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_27|)))))) is different from false [2024-10-24 16:30:00,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:00,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 143 [2024-10-24 16:30:00,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:00,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2024-10-24 16:30:00,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:00,484 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 97 [2024-10-24 16:30:00,511 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 316 treesize of output 304 [2024-10-24 16:30:00,541 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 826 treesize of output 790 [2024-10-24 16:30:00,562 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 139 treesize of output 137 [2024-10-24 16:30:00,573 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 137 treesize of output 135 [2024-10-24 16:30:00,585 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 135 treesize of output 131 [2024-10-24 16:30:00,599 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 131 treesize of output 127 [2024-10-24 16:30:00,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:00,635 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 118 [2024-10-24 16:30:00,656 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 256 treesize of output 236 [2024-10-24 16:30:00,673 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 149 treesize of output 145 [2024-10-24 16:30:00,688 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 145 treesize of output 137 [2024-10-24 16:30:01,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:30:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397830638] [2024-10-24 16:30:01,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397830638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:01,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [309905186] [2024-10-24 16:30:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:30:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:30:01,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:30:01,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-24 16:30:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:01,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 16:30:01,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:02,075 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 16:30:02,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-24 16:30:02,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:30:03,488 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-10-24 16:30:03,504 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-10-24 16:30:04,021 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 16 treesize of output 11 [2024-10-24 16:30:04,041 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 16 treesize of output 11 [2024-10-24 16:30:04,103 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:04,103 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 61 treesize of output 54 [2024-10-24 16:30:04,115 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 24 treesize of output 11 [2024-10-24 16:30:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:04,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:04,709 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:30:04,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-10-24 16:30:04,793 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2024-10-24 16:30:04,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2024-10-24 16:30:05,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:05,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-24 16:30:05,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 25 treesize of output 13 [2024-10-24 16:30:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:05,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:06,087 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_630) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_630) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_629) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2024-10-24 16:30:13,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2024-10-24 16:30:13,386 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:13,393 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 46 treesize of output 34 [2024-10-24 16:30:13,438 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 11 treesize of output 7 [2024-10-24 16:30:13,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,472 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2024-10-24 16:30:13,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:13,486 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 84 treesize of output 76 [2024-10-24 16:30:13,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:13,520 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2024-10-24 16:30:13,528 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:13,534 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 96 treesize of output 84 [2024-10-24 16:30:13,548 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 18 treesize of output 16 [2024-10-24 16:30:13,562 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 16 treesize of output 14 [2024-10-24 16:30:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [309905186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:14,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:30:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2024-10-24 16:30:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000794559] [2024-10-24 16:30:14,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:14,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-24 16:30:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:30:14,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-24 16:30:14,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1096, Unknown=17, NotChecked=210, Total=1482 [2024-10-24 16:30:14,406 INFO L87 Difference]: Start difference. First operand 263 states and 334 transitions. Second operand has 27 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:30:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:26,830 INFO L93 Difference]: Finished difference Result 345 states and 386 transitions. [2024-10-24 16:30:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:30:26,831 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-10-24 16:30:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:26,833 INFO L225 Difference]: With dead ends: 345 [2024-10-24 16:30:26,833 INFO L226 Difference]: Without dead ends: 345 [2024-10-24 16:30:26,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=291, Invalid=1510, Unknown=17, NotChecked=252, Total=2070 [2024-10-24 16:30:26,834 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 520 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:26,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1149 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-10-24 16:30:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-24 16:30:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 256. [2024-10-24 16:30:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 174 states have (on average 1.6781609195402298) internal successors, (292), 240 states have internal predecessors, (292), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:30:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 325 transitions. [2024-10-24 16:30:26,845 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 325 transitions. Word has length 24 [2024-10-24 16:30:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:26,845 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 325 transitions. [2024-10-24 16:30:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:30:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 325 transitions. [2024-10-24 16:30:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:30:26,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:26,849 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] [2024-10-24 16:30:26,857 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-10-24 16:30:27,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-10-24 16:30:27,249 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 16:30:27,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:30:27,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 246383339, now seen corresponding path program 1 times [2024-10-24 16:30:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:30:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947150224] [2024-10-24 16:30:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:27,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-10-24 16:30:27,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:30:27,252 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-10-24 16:30:27,253 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-10-24 16:30:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:27,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:30:27,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:27,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:30:27,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:30:27,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947150224] [2024-10-24 16:30:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947150224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085864643] [2024-10-24 16:30:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:27,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:27,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:30:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:27,600 INFO L87 Difference]: Start difference. First operand 256 states and 325 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:30:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:28,151 INFO L93 Difference]: Finished difference Result 255 states and 322 transitions. [2024-10-24 16:30:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2024-10-24 16:30:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:28,153 INFO L225 Difference]: With dead ends: 255 [2024-10-24 16:30:28,153 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 16:30:28,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:28,154 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 265 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:28,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 379 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:30:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 16:30:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-24 16:30:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 174 states have (on average 1.6666666666666667) internal successors, (290), 239 states have internal predecessors, (290), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:30:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 322 transitions. [2024-10-24 16:30:28,163 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 322 transitions. Word has length 25 [2024-10-24 16:30:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:28,163 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 322 transitions. [2024-10-24 16:30:28,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 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-10-24 16:30:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2024-10-24 16:30:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:30:28,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:28,165 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] [2024-10-24 16:30:28,170 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-10-24 16:30:28,365 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-10-24 16:30:28,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting inspectErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:30:28,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1320502083, now seen corresponding path program 1 times [2024-10-24 16:30:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:30:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325275375] [2024-10-24 16:30:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:28,368 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-10-24 16:30:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:30:28,369 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-10-24 16:30:28,370 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-10-24 16:30:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:28,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:30:28,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:28,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:28,688 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-10-24 16:30:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:29,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:30:29,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:30:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325275375] [2024-10-24 16:30:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325275375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869477266] [2024-10-24 16:30:29,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:29,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:30:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:30:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:30:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:30:29,483 INFO L87 Difference]: Start difference. First operand 255 states and 322 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-10-24 16:30:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:31,307 INFO L93 Difference]: Finished difference Result 253 states and 318 transitions. [2024-10-24 16:30:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:30:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 26 [2024-10-24 16:30:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:31,308 INFO L225 Difference]: With dead ends: 253 [2024-10-24 16:30:31,308 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 16:30:31,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:31,309 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 424 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:31,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 178 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 16:30:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 16:30:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-24 16:30:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 237 states have internal predecessors, (286), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:30:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 318 transitions. [2024-10-24 16:30:31,315 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 318 transitions. Word has length 26 [2024-10-24 16:30:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:31,315 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 318 transitions. [2024-10-24 16:30:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-10-24 16:30:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 318 transitions. [2024-10-24 16:30:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:30:31,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:31,316 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] [2024-10-24 16:30:31,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 (20)] Ended with exit code 0 [2024-10-24 16:30:31,516 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-10-24 16:30:31,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:30:31,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1975789109, now seen corresponding path program 1 times [2024-10-24 16:30:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:30:31,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189807613] [2024-10-24 16:30:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:31,518 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-10-24 16:30:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:30:31,519 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-10-24 16:30:31,520 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-10-24 16:30:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:31,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:30:31,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:31,744 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:30:31,744 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-10-24 16:30:32,308 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-10-24 16:30:32,557 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 16 treesize of output 11 [2024-10-24 16:30:32,627 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:32,627 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 25 treesize of output 26 [2024-10-24 16:30:32,950 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 16 treesize of output 8 [2024-10-24 16:30:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:33,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:30:33,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:30:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189807613] [2024-10-24 16:30:33,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189807613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:33,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:33,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 16:30:33,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389943590] [2024-10-24 16:30:33,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:33,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:30:33,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:30:33,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:30:33,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:30:33,037 INFO L87 Difference]: Start difference. First operand 253 states and 318 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 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-10-24 16:30:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:38,235 INFO L93 Difference]: Finished difference Result 322 states and 360 transitions. [2024-10-24 16:30:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:30:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 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 28 [2024-10-24 16:30:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:38,238 INFO L225 Difference]: With dead ends: 322 [2024-10-24 16:30:38,238 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 16:30:38,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:30:38,238 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 696 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:38,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 876 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 16:30:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 16:30:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 253. [2024-10-24 16:30:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 174 states have (on average 1.6379310344827587) internal successors, (285), 237 states have internal predecessors, (285), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 16:30:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 317 transitions. [2024-10-24 16:30:38,245 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 317 transitions. Word has length 28 [2024-10-24 16:30:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:38,245 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 317 transitions. [2024-10-24 16:30:38,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 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-10-24 16:30:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 317 transitions. [2024-10-24 16:30:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 16:30:38,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:38,247 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] [2024-10-24 16:30:38,254 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-10-24 16:30:38,447 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-10-24 16:30:38,447 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:30:38,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1620033190, now seen corresponding path program 1 times [2024-10-24 16:30:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:30:38,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041889284] [2024-10-24 16:30:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:38,448 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-10-24 16:30:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:30:38,449 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-10-24 16:30:38,451 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-10-24 16:30:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:38,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 16:30:38,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:38,778 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:30:38,778 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-10-24 16:30:38,957 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 16 treesize of output 11 [2024-10-24 16:30:38,996 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 16 treesize of output 11 [2024-10-24 16:30:40,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-10-24 16:30:40,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:40,761 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 32 treesize of output 15 [2024-10-24 16:30:40,774 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 17 treesize of output 18 [2024-10-24 16:30:40,992 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 23 treesize of output 16 [2024-10-24 16:30:41,044 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 23 treesize of output 16 [2024-10-24 16:30:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:41,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:30:41,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:30:41,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041889284] [2024-10-24 16:30:41,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041889284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:41,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:41,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 16:30:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036922435] [2024-10-24 16:30:41,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:41,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:30:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:30:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:30:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=205, Unknown=1, NotChecked=0, Total=240 [2024-10-24 16:30:41,928 INFO L87 Difference]: Start difference. First operand 253 states and 317 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 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-10-24 16:30:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:54,527 INFO L93 Difference]: Finished difference Result 407 states and 489 transitions. [2024-10-24 16:30:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:30:54,528 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 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 31 [2024-10-24 16:30:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:54,529 INFO L225 Difference]: With dead ends: 407 [2024-10-24 16:30:54,529 INFO L226 Difference]: Without dead ends: 407 [2024-10-24 16:30:54,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=82, Invalid=469, Unknown=1, NotChecked=0, Total=552 [2024-10-24 16:30:54,530 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 327 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:54,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 889 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1920 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2024-10-24 16:30:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-24 16:30:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 343. [2024-10-24 16:30:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 256 states have (on average 1.6015625) internal successors, (410), 320 states have internal predecessors, (410), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 16:30:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 452 transitions. [2024-10-24 16:30:54,540 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 452 transitions. Word has length 31 [2024-10-24 16:30:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 452 transitions. [2024-10-24 16:30:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 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-10-24 16:30:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 452 transitions. [2024-10-24 16:30:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:30:54,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:54,542 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-10-24 16:30:54,549 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 (22)] Ended with exit code 0 [2024-10-24 16:30:54,742 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-10-24 16:30:54,743 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting inspectErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2024-10-24 16:30:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash 997564862, now seen corresponding path program 1 times [2024-10-24 16:30:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:30:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637064816] [2024-10-24 16:30:54,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:54,743 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-10-24 16:30:54,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:30:54,745 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-10-24 16:30:54,746 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-10-24 16:30:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:54,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 16:30:54,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:55,151 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 16:30:55,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-24 16:30:55,423 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 16 treesize of output 11 [2024-10-24 16:30:55,456 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 16 treesize of output 11 [2024-10-24 16:30:57,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-10-24 16:30:57,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2024-10-24 16:30:57,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:57,650 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 14 [2024-10-24 16:30:57,662 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 0 case distinctions, treesize of input 23 treesize of output 14