./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/uthash-2.0.2/uthash_BER_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:45:48,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:45:48,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:45:48,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:45:48,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:45:48,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:45:48,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:45:48,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:45:48,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:45:48,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:45:48,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:45:48,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:45:48,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:45:48,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:45:48,703 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:45:48,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:45:48,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:45:48,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:45:48,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:45:48,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:45:48,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:45:48,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:45:48,711 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:45:48,711 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:45:48,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:45:48,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:45:48,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:45:48,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:45:48,712 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:45:48,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:45:48,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:45:48,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:45:48,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:45:48,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:45:48,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:45:48,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:45:48,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:45:48,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:45:48,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:45:48,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:45:48,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:45:48,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:45:48,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:45:48,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:45:48,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:45:48,718 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-memcleanup) ) 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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-10-24 15:45:48,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:45:49,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:45:49,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:45:49,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:45:49,007 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:45:49,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-24 15:45:50,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:45:50,817 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:45:50,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-24 15:45:50,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e780c9e3/190057ce3ff94f28853854ae3f4222fa/FLAG7d9f84fe5 [2024-10-24 15:45:50,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e780c9e3/190057ce3ff94f28853854ae3f4222fa [2024-10-24 15:45:50,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:45:50,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:45:50,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:50,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:45:50,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:45:50,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:50" (1/1) ... [2024-10-24 15:45:50,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55535a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:50, skipping insertion in model container [2024-10-24 15:45:50,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:50" (1/1) ... [2024-10-24 15:45:50,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:45:51,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:51,683 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 15:45:51,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6279d505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:51, skipping insertion in model container [2024-10-24 15:45:51,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:51,685 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:45:51,688 INFO L158 Benchmark]: Toolchain (without parser) took 828.35ms. Allocated memory is still 157.3MB. Free memory was 90.1MB in the beginning and 114.6MB in the end (delta: -24.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:45:51,688 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:45:51,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 824.36ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 114.6MB in the end (delta: -24.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:45:51,691 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.21ms. Allocated memory is still 96.5MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 824.36ms. Allocated memory is still 157.3MB. Free memory was 89.7MB in the beginning and 114.6MB in the end (delta: -24.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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/uthash-2.0.2/uthash_BER_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:45:53,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:45:53,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:45:53,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:45:53,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:45:53,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:45:53,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:45:53,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:45:53,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:45:53,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:45:53,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:45:53,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:45:53,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:45:53,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:45:53,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:45:53,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:45:53,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:45:53,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:45:53,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:45:53,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:45:53,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:45:53,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:45:53,939 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:45:53,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:45:53,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:45:53,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:45:53,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:45:53,941 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:45:53,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:45:53,941 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:45:53,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:45:53,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:45:53,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:45:53,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:45:53,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:45:53,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:45:53,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:45:53,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:45:53,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:45:53,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:45:53,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:45:53,945 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:45:53,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:45:53,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:45:53,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:45:53,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:45:53,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:45:53,946 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:45:53,946 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-memcleanup) ) 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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-10-24 15:45:54,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:45:54,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:45:54,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:45:54,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:45:54,359 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:45:54,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-24 15:45:55,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:45:56,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:45:56,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-10-24 15:45:56,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017bbda47/4a3e00f6394a4d178d4d323bb55eb6ff/FLAG8ac660de3 [2024-10-24 15:45:56,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017bbda47/4a3e00f6394a4d178d4d323bb55eb6ff [2024-10-24 15:45:56,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:45:56,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:45:56,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:56,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:45:56,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:45:56,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:56" (1/1) ... [2024-10-24 15:45:56,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466ed911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:56, skipping insertion in model container [2024-10-24 15:45:56,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:56" (1/1) ... [2024-10-24 15:45:56,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:45:57,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:57,182 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:45:57,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:45:57,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:57,303 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:45:57,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:57,487 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:45:57,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57 WrapperNode [2024-10-24 15:45:57,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:57,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:45:57,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:45:57,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:45:57,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,610 INFO L138 Inliner]: procedures = 285, calls = 343, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1224 [2024-10-24 15:45:57,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:45:57,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:45:57,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:45:57,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:45:57,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,775 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 3, 34, 270]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 2, 4, 57]. [2024-10-24 15:45:57,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:45:57,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:45:57,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:45:57,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:45:57,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (1/1) ... [2024-10-24 15:45:57,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:45:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:45:57,888 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 15:45:57,891 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 15:45:57,930 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:45:57,930 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:45:57,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:45:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-24 15:45:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-24 15:45:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:45:57,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-24 15:45:57,934 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-24 15:45:57,934 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-24 15:45:57,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:45:57,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:45:58,214 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:45:58,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:46:07,186 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-10-24 15:46:07,187 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:46:07,238 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:46:07,238 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-24 15:46:07,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:46:07 BoogieIcfgContainer [2024-10-24 15:46:07,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:46:07,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:46:07,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:46:07,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:46:07,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:45:56" (1/3) ... [2024-10-24 15:46:07,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1297b8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:46:07, skipping insertion in model container [2024-10-24 15:46:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:57" (2/3) ... [2024-10-24 15:46:07,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1297b8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:46:07, skipping insertion in model container [2024-10-24 15:46:07,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:46:07" (3/3) ... [2024-10-24 15:46:07,247 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2024-10-24 15:46:07,260 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:46:07,260 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:46:07,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:46:07,318 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;@295ad4ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:46:07,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:46:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 232 states have (on average 1.6336206896551724) internal successors, (379), 237 states have internal predecessors, (379), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 15:46:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 15:46:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:07,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:07,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:07,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash -711634754, now seen corresponding path program 1 times [2024-10-24 15:46:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123555265] [2024-10-24 15:46:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:07,346 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 15:46:07,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:07,350 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 15:46:07,352 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 15:46:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:07,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:46:07,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:07,586 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 15:46:07,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:07,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123555265] [2024-10-24 15:46:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123555265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:46:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351619179] [2024-10-24 15:46:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:07,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:46:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:46:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:46:07,626 INFO L87 Difference]: Start difference. First operand has 259 states, 232 states have (on average 1.6336206896551724) internal successors, (379), 237 states have internal predecessors, (379), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 15:46:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:07,703 INFO L93 Difference]: Finished difference Result 254 states and 332 transitions. [2024-10-24 15:46:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:46:07,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 15:46:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:07,719 INFO L225 Difference]: With dead ends: 254 [2024-10-24 15:46:07,728 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 15:46:07,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 15:46:07,734 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:07,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:46:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 15:46:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-24 15:46:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 228 states have (on average 1.3026315789473684) internal successors, (297), 233 states have internal predecessors, (297), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 15:46:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 331 transitions. [2024-10-24 15:46:07,832 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 331 transitions. Word has length 9 [2024-10-24 15:46:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:07,834 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 331 transitions. [2024-10-24 15:46:07,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 15:46:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 331 transitions. [2024-10-24 15:46:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 15:46:07,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:07,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:07,843 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 15:46:08,035 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 15:46:08,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:08,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1093340257, now seen corresponding path program 1 times [2024-10-24 15:46:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409812131] [2024-10-24 15:46:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:08,038 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 15:46:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:08,041 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 15:46:08,042 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 15:46:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:08,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:08,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:08,375 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 15:46:08,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:08,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409812131] [2024-10-24 15:46:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409812131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:08,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:46:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814619643] [2024-10-24 15:46:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:08,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:08,394 INFO L87 Difference]: Start difference. First operand 253 states and 331 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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 15:46:10,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:46:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:13,720 INFO L93 Difference]: Finished difference Result 406 states and 533 transitions. [2024-10-24 15:46:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) 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 15:46:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:13,724 INFO L225 Difference]: With dead ends: 406 [2024-10-24 15:46:13,724 INFO L226 Difference]: Without dead ends: 406 [2024-10-24 15:46:13,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:46:13,726 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 183 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:13,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 919 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-24 15:46:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-24 15:46:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 370. [2024-10-24 15:46:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 342 states have (on average 1.304093567251462) internal successors, (446), 347 states have internal predecessors, (446), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 15:46:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2024-10-24 15:46:13,750 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 11 [2024-10-24 15:46:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:13,751 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2024-10-24 15:46:13,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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 15:46:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2024-10-24 15:46:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 15:46:13,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:13,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:13,760 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:13,952 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 15:46:13,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:13,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:13,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2126280651, now seen corresponding path program 1 times [2024-10-24 15:46:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:13,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168702908] [2024-10-24 15:46:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:13,954 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 15:46:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:13,957 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 15:46:13,964 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 15:46:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:14,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:14,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:14,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:14,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:14,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:14,304 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 30 treesize of output 39 [2024-10-24 15:46:14,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:46:14,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:46:14,407 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 15:46:14,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:14,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:14,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168702908] [2024-10-24 15:46:14,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168702908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:46:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145913311] [2024-10-24 15:46:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:14,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:14,410 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:15,108 INFO L93 Difference]: Finished difference Result 581 states and 770 transitions. [2024-10-24 15:46:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:15,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 15:46:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:15,113 INFO L225 Difference]: With dead ends: 581 [2024-10-24 15:46:15,113 INFO L226 Difference]: Without dead ends: 581 [2024-10-24 15:46:15,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:46:15,114 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 270 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:15,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1011 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 15:46:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-24 15:46:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 369. [2024-10-24 15:46:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 341 states have (on average 1.3020527859237536) internal successors, (444), 346 states have internal predecessors, (444), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 15:46:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 484 transitions. [2024-10-24 15:46:15,144 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 484 transitions. Word has length 14 [2024-10-24 15:46:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 484 transitions. [2024-10-24 15:46:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 484 transitions. [2024-10-24 15:46:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 15:46:15,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:15,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:15,153 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 15:46:15,347 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 15:46:15,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:15,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:15,348 INFO L85 PathProgramCache]: Analyzing trace with hash -130810140, now seen corresponding path program 1 times [2024-10-24 15:46:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353060802] [2024-10-24 15:46:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:15,349 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 15:46:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:15,351 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 15:46:15,352 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 15:46:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:15,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:46:15,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:15,694 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 15:46:15,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:15,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:15,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353060802] [2024-10-24 15:46:15,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353060802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:15,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:15,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:46:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772107297] [2024-10-24 15:46:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:15,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:15,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:15,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:15,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:15,699 INFO L87 Difference]: Start difference. First operand 369 states and 484 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:15,925 INFO L93 Difference]: Finished difference Result 375 states and 474 transitions. [2024-10-24 15:46:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:46:15,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-24 15:46:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:15,928 INFO L225 Difference]: With dead ends: 375 [2024-10-24 15:46:15,928 INFO L226 Difference]: Without dead ends: 375 [2024-10-24 15:46:15,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:46:15,930 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 30 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:15,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 862 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:46:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-24 15:46:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-24 15:46:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 347 states have (on average 1.2507204610951008) internal successors, (434), 352 states have internal predecessors, (434), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 15:46:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 474 transitions. [2024-10-24 15:46:15,947 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 474 transitions. Word has length 48 [2024-10-24 15:46:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 474 transitions. [2024-10-24 15:46:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 474 transitions. [2024-10-24 15:46:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 15:46:15,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:15,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:15,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:16,149 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 15:46:16,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:16,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash 323773912, now seen corresponding path program 1 times [2024-10-24 15:46:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333295913] [2024-10-24 15:46:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:16,151 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 15:46:16,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:16,154 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 15:46:16,156 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 15:46:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:16,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:16,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:16,550 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 15:46:16,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:16,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:16,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333295913] [2024-10-24 15:46:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333295913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 15:46:16,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597602070] [2024-10-24 15:46:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:46:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:16,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:46:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:46:16,553 INFO L87 Difference]: Start difference. First operand 375 states and 474 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:16,846 INFO L93 Difference]: Finished difference Result 384 states and 483 transitions. [2024-10-24 15:46:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:46:16,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-24 15:46:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:16,851 INFO L225 Difference]: With dead ends: 384 [2024-10-24 15:46:16,852 INFO L226 Difference]: Without dead ends: 384 [2024-10-24 15:46:16,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:46:16,853 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 8 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:16,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1530 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:46:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-24 15:46:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-10-24 15:46:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 353 states have (on average 1.2492917847025495) internal successors, (441), 359 states have internal predecessors, (441), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 15:46:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 483 transitions. [2024-10-24 15:46:16,867 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 483 transitions. Word has length 48 [2024-10-24 15:46:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 483 transitions. [2024-10-24 15:46:16,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 483 transitions. [2024-10-24 15:46:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 15:46:16,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:16,870 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:16,879 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 15:46:17,070 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 15:46:17,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:17,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash -441157344, now seen corresponding path program 1 times [2024-10-24 15:46:17,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:17,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157420017] [2024-10-24 15:46:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:17,073 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 15:46:17,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:17,076 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 15:46:17,078 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 15:46:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:17,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:17,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:17,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:17,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:17,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157420017] [2024-10-24 15:46:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157420017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:17,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:46:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793407592] [2024-10-24 15:46:17,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:17,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:46:17,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:17,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:46:17,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:46:17,863 INFO L87 Difference]: Start difference. First operand 384 states and 483 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:46:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:18,329 INFO L93 Difference]: Finished difference Result 390 states and 491 transitions. [2024-10-24 15:46:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 15:46:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2024-10-24 15:46:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:18,336 INFO L225 Difference]: With dead ends: 390 [2024-10-24 15:46:18,336 INFO L226 Difference]: Without dead ends: 390 [2024-10-24 15:46:18,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:46:18,337 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 17 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:18,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1126 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:46:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-24 15:46:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2024-10-24 15:46:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 354 states have (on average 1.2485875706214689) internal successors, (442), 361 states have internal predecessors, (442), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-10-24 15:46:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2024-10-24 15:46:18,358 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 60 [2024-10-24 15:46:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:18,359 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2024-10-24 15:46:18,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:46:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2024-10-24 15:46:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 15:46:18,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:18,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:18,375 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 15:46:18,562 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 15:46:18,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash 468705426, now seen corresponding path program 1 times [2024-10-24 15:46:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:18,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629045842] [2024-10-24 15:46:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:18,564 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 15:46:18,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:18,569 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 15:46:18,575 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 15:46:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:18,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:18,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:19,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:19,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629045842] [2024-10-24 15:46:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629045842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:46:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513067456] [2024-10-24 15:46:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:19,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:19,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:19,023 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:46:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:19,199 INFO L93 Difference]: Finished difference Result 389 states and 490 transitions. [2024-10-24 15:46:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:19,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2024-10-24 15:46:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:19,202 INFO L225 Difference]: With dead ends: 389 [2024-10-24 15:46:19,202 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 15:46:19,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:19,203 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:19,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 922 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:46:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 15:46:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-24 15:46:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 355 states have (on average 1.2507042253521128) internal successors, (444), 363 states have internal predecessors, (444), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-24 15:46:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 490 transitions. [2024-10-24 15:46:19,215 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 490 transitions. Word has length 65 [2024-10-24 15:46:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:19,216 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 490 transitions. [2024-10-24 15:46:19,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:46:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 490 transitions. [2024-10-24 15:46:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:46:19,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:19,218 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:19,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:19,418 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 15:46:19,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:19,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -638364359, now seen corresponding path program 1 times [2024-10-24 15:46:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:19,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710607818] [2024-10-24 15:46:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:19,420 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 15:46:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:19,422 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 15:46:19,423 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 15:46:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:19,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:46:19,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:19,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:20,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710607818] [2024-10-24 15:46:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710607818] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:20,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:46:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034241969] [2024-10-24 15:46:20,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:46:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:20,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:46:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:46:20,112 INFO L87 Difference]: Start difference. First operand 389 states and 490 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:20,461 INFO L93 Difference]: Finished difference Result 398 states and 504 transitions. [2024-10-24 15:46:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:46:20,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-10-24 15:46:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:20,466 INFO L225 Difference]: With dead ends: 398 [2024-10-24 15:46:20,466 INFO L226 Difference]: Without dead ends: 398 [2024-10-24 15:46:20,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 15:46:20,466 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 5 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:20,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1224 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:46:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-24 15:46:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2024-10-24 15:46:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 362 states have (on average 1.2624309392265194) internal successors, (457), 370 states have internal predecessors, (457), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-24 15:46:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2024-10-24 15:46:20,481 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 66 [2024-10-24 15:46:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:20,481 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2024-10-24 15:46:20,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2024-10-24 15:46:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 15:46:20,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:20,483 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:20,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:20,683 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 15:46:20,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash 997937746, now seen corresponding path program 2 times [2024-10-24 15:46:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707087784] [2024-10-24 15:46:20,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:46:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:46:20,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:20,686 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 15:46:20,687 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 15:46:21,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:46:21,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:21,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 15:46:21,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:21,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:22,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707087784] [2024-10-24 15:46:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707087784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:22,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:46:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874037764] [2024-10-24 15:46:22,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:46:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:46:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:46:22,005 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:23,120 INFO L93 Difference]: Finished difference Result 409 states and 522 transitions. [2024-10-24 15:46:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:46:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2024-10-24 15:46:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:23,124 INFO L225 Difference]: With dead ends: 409 [2024-10-24 15:46:23,124 INFO L226 Difference]: Without dead ends: 407 [2024-10-24 15:46:23,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:46:23,125 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 7 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:23,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3054 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 15:46:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-24 15:46:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 406. [2024-10-24 15:46:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 379 states have internal predecessors, (469), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-24 15:46:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 515 transitions. [2024-10-24 15:46:23,147 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 515 transitions. Word has length 69 [2024-10-24 15:46:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:23,148 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 515 transitions. [2024-10-24 15:46:23,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 515 transitions. [2024-10-24 15:46:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 15:46:23,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:23,152 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:23,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:23,352 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 15:46:23,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1628202766, now seen corresponding path program 3 times [2024-10-24 15:46:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386854136] [2024-10-24 15:46:23,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:46:23,354 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 15:46:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:23,355 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 15:46:23,356 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 15:46:24,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:46:24,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:24,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 15:46:24,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 15:46:24,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 15:46:24,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386854136] [2024-10-24 15:46:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386854136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:24,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:24,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-24 15:46:24,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60684767] [2024-10-24 15:46:24,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:24,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 15:46:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:24,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 15:46:24,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 15:46:24,592 INFO L87 Difference]: Start difference. First operand 406 states and 515 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:46:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:27,016 INFO L93 Difference]: Finished difference Result 3083 states and 3979 transitions. [2024-10-24 15:46:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 15:46:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2024-10-24 15:46:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:27,036 INFO L225 Difference]: With dead ends: 3083 [2024-10-24 15:46:27,037 INFO L226 Difference]: Without dead ends: 3083 [2024-10-24 15:46:27,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-10-24 15:46:27,038 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 4875 mSDsluCounter, 4446 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 5308 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:27,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 5308 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 15:46:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2024-10-24 15:46:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2121. [2024-10-24 15:46:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1983 states have (on average 1.2778618255168936) internal successors, (2534), 2004 states have internal predecessors, (2534), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-24 15:46:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2734 transitions. [2024-10-24 15:46:27,109 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2734 transitions. Word has length 75 [2024-10-24 15:46:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:27,110 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2734 transitions. [2024-10-24 15:46:27,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:46:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2734 transitions. [2024-10-24 15:46:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 15:46:27,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:27,113 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:46:27,127 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 15:46:27,313 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 15:46:27,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 249438597, now seen corresponding path program 1 times [2024-10-24 15:46:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370791317] [2024-10-24 15:46:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:27,315 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 15:46:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:27,316 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 15:46:27,317 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 15:46:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:27,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 15:46:27,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:46:28,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 15:46:29,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:29,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370791317] [2024-10-24 15:46:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370791317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:29,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:46:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045787316] [2024-10-24 15:46:29,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:46:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:29,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:46:29,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:46:29,562 INFO L87 Difference]: Start difference. First operand 2121 states and 2734 transitions. Second operand has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 15:46:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:32,635 INFO L93 Difference]: Finished difference Result 2226 states and 2919 transitions. [2024-10-24 15:46:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:46:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2024-10-24 15:46:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:32,645 INFO L225 Difference]: With dead ends: 2226 [2024-10-24 15:46:32,645 INFO L226 Difference]: Without dead ends: 2216 [2024-10-24 15:46:32,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:46:32,647 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 14 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4274 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:32,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4274 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 15:46:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-10-24 15:46:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2211. [2024-10-24 15:46:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2073 states have (on average 1.2802701398938736) internal successors, (2654), 2094 states have internal predecessors, (2654), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-24 15:46:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2854 transitions. [2024-10-24 15:46:32,699 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2854 transitions. Word has length 111 [2024-10-24 15:46:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:32,700 INFO L471 AbstractCegarLoop]: Abstraction has 2211 states and 2854 transitions. [2024-10-24 15:46:32,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 15:46:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2854 transitions. [2024-10-24 15:46:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 15:46:32,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:32,702 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:46:32,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:32,902 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 15:46:32,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1525892965, now seen corresponding path program 2 times [2024-10-24 15:46:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740391797] [2024-10-24 15:46:32,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:46:32,904 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 15:46:32,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:32,905 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 15:46:32,906 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 15:46:33,306 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:46:33,306 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:33,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:46:33,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:33,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:33,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:33,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:33,332 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 30 treesize of output 39 [2024-10-24 15:46:33,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:46:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:46:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-10-24 15:46:33,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:33,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740391797] [2024-10-24 15:46:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740391797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:33,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:46:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659299220] [2024-10-24 15:46:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:33,412 INFO L87 Difference]: Start difference. First operand 2211 states and 2854 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 15:46:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:33,914 INFO L93 Difference]: Finished difference Result 2963 states and 3856 transitions. [2024-10-24 15:46:33,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:33,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 129 [2024-10-24 15:46:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:33,924 INFO L225 Difference]: With dead ends: 2963 [2024-10-24 15:46:33,925 INFO L226 Difference]: Without dead ends: 2963 [2024-10-24 15:46:33,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:46:33,926 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 212 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:33,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 867 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:46:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2024-10-24 15:46:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2223. [2024-10-24 15:46:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2085 states have (on average 1.2786570743405277) internal successors, (2666), 2106 states have internal predecessors, (2666), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-24 15:46:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2866 transitions. [2024-10-24 15:46:33,980 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2866 transitions. Word has length 129 [2024-10-24 15:46:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 2866 transitions. [2024-10-24 15:46:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 15:46:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2866 transitions. [2024-10-24 15:46:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 15:46:33,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:33,982 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:46:34,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:34,186 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 15:46:34,187 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:34,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1915621368, now seen corresponding path program 1 times [2024-10-24 15:46:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898702248] [2024-10-24 15:46:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:34,189 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 15:46:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:34,190 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 15:46:34,191 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 15:46:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:34,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 15:46:34,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 311 proven. 253 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 15:46:36,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-24 15:46:38,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:38,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898702248] [2024-10-24 15:46:38,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898702248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:38,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:38,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:46:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700788046] [2024-10-24 15:46:38,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:38,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:46:38,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:46:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:46:38,977 INFO L87 Difference]: Start difference. First operand 2223 states and 2866 transitions. Second operand has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 15:46:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:55,628 INFO L93 Difference]: Finished difference Result 2408 states and 3211 transitions. [2024-10-24 15:46:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:46:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 133 [2024-10-24 15:46:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:55,636 INFO L225 Difference]: With dead ends: 2408 [2024-10-24 15:46:55,636 INFO L226 Difference]: Without dead ends: 2398 [2024-10-24 15:46:55,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:46:55,641 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 25 mSDsluCounter, 7320 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7629 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:55,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7629 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 15:46:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-10-24 15:46:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2393. [2024-10-24 15:46:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2255 states have (on average 1.2842572062084257) internal successors, (2896), 2276 states have internal predecessors, (2896), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-24 15:46:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3096 transitions. [2024-10-24 15:46:55,688 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3096 transitions. Word has length 133 [2024-10-24 15:46:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3096 transitions. [2024-10-24 15:46:55,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 15:46:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3096 transitions. [2024-10-24 15:46:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 15:46:55,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:55,690 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:46:55,712 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 15:46:55,891 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 15:46:55,891 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1083881752, now seen corresponding path program 2 times [2024-10-24 15:46:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198446092] [2024-10-24 15:46:55,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:46:55,893 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 15:46:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:55,896 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 15:46:55,898 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 15:46:57,665 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:46:57,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:57,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 15:46:57,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1162 proven. 276 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2024-10-24 15:46:58,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:47:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1081 proven. 301 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2024-10-24 15:47:01,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:47:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198446092] [2024-10-24 15:47:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198446092] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:47:01,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:47:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:47:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570279193] [2024-10-24 15:47:01,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:47:01,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:47:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:47:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:47:01,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:47:01,505 INFO L87 Difference]: Start difference. First operand 2393 states and 3096 transitions. Second operand has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)