./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_SFH_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 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_SFH_test9-1.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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:40:57,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:40:58,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:40:58,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:40:58,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:40:58,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:40:58,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:40:58,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:40:58,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:40:58,059 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:40:58,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:40:58,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:40:58,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:40:58,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:40:58,060 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:40:58,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:40:58,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:40:58,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:40:58,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:40:58,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:40:58,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:40:58,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:40:58,062 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:40:58,063 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:40:58,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:40:58,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:40:58,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:40:58,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:40:58,064 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:40:58,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:40:58,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:40:58,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:40:58,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:40:58,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:40:58,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:40:58,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:40:58,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:40:58,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:40:58,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:40:58,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:40:58,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:40:58,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:40:58,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:40:58,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:40:58,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:40:58,071 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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2024-10-14 17:40:58,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:40:58,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:40:58,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:40:58,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:40:58,316 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:40:58,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-10-14 17:40:59,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:40:59,938 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:40:59,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-10-14 17:40:59,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f209d2a97/3ce78b7a1ec84183b05176f47a49f5d5/FLAG4aab86879 [2024-10-14 17:41:00,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f209d2a97/3ce78b7a1ec84183b05176f47a49f5d5 [2024-10-14 17:41:00,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:41:00,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:41:00,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:41:00,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:41:00,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:41:00,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:41:00" (1/1) ... [2024-10-14 17:41:00,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32db43c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:00, skipping insertion in model container [2024-10-14 17:41:00,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:41:00" (1/1) ... [2024-10-14 17:41:00,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:41:00,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:41:00,757 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-14 17:41:00,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d73e350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:00, skipping insertion in model container [2024-10-14 17:41:00,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:41:00,761 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:41:00,762 INFO L158 Benchmark]: Toolchain (without parser) took 552.76ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 69.1MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 17:41:00,763 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:41:00,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.10ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 69.1MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 17:41:00,764 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.09ms. Allocated memory is still 161.5MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.10ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 69.1MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: 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_SFH_test9-1.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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:41:02,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:41:02,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:41:02,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:41:02,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:41:02,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:41:02,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:41:02,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:41:02,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:41:02,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:41:02,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:41:02,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:41:02,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:41:02,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:41:02,636 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:41:02,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:41:02,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:41:02,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:41:02,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:41:02,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:41:02,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:41:02,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:41:02,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:41:02,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:41:02,643 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:41:02,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:41:02,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:41:02,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:41:02,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:41:02,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:41:02,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:41:02,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:41:02,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:41:02,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:41:02,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:41:02,645 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:41:02,645 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:41:02,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:41:02,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:41:02,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:41:02,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:41:02,647 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:41:02,647 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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2024-10-14 17:41:02,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:41:02,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:41:02,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:41:02,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:41:02,961 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:41:02,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-10-14 17:41:04,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:41:04,612 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:41:04,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-10-14 17:41:04,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6655b913/bc8e06c30f694982886a42e1fc74ee67/FLAGfbf22030f [2024-10-14 17:41:04,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6655b913/bc8e06c30f694982886a42e1fc74ee67 [2024-10-14 17:41:04,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:41:04,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:41:04,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:41:04,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:41:04,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:41:04,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:41:04" (1/1) ... [2024-10-14 17:41:04,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d949fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:04, skipping insertion in model container [2024-10-14 17:41:04,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:41:04" (1/1) ... [2024-10-14 17:41:04,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:41:05,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:41:05,263 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:41:05,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:41:05,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:41:05,413 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:41:05,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:41:05,566 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:41:05,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05 WrapperNode [2024-10-14 17:41:05,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:41:05,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:41:05,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:41:05,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:41:05,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,676 INFO L138 Inliner]: procedures = 180, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2885 [2024-10-14 17:41:05,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:41:05,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:41:05,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:41:05,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:41:05,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,784 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-14 17:41:05,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:41:05,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:41:05,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:41:05,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:41:05,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (1/1) ... [2024-10-14 17:41:05,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:41:05,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:41:05,891 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-14 17:41:05,895 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-14 17:41:05,932 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 17:41:05,932 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 17:41:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:41:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:41:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:41:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:41:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:41:05,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:41:05,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 17:41:05,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:41:05,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:41:05,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:41:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:41:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:41:05,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:41:06,143 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:41:06,145 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:41:15,489 INFO L? ?]: Removed 619 outVars from TransFormulas that were not future-live. [2024-10-14 17:41:15,489 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:41:15,558 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:41:15,558 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-14 17:41:15,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:41:15 BoogieIcfgContainer [2024-10-14 17:41:15,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:41:15,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:41:15,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:41:15,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:41:15,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:41:04" (1/3) ... [2024-10-14 17:41:15,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbdc583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:41:15, skipping insertion in model container [2024-10-14 17:41:15,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:41:05" (2/3) ... [2024-10-14 17:41:15,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbdc583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:41:15, skipping insertion in model container [2024-10-14 17:41:15,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:41:15" (3/3) ... [2024-10-14 17:41:15,565 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-1.i [2024-10-14 17:41:15,579 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:41:15,579 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:41:15,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:41:15,649 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;@6bc24a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:41:15,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:41:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 1172 states, 661 states have (on average 1.91981845688351) internal successors, (1269), 1165 states have internal predecessors, (1269), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-14 17:41:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:41:15,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:15,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:41:15,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:15,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1002457444, now seen corresponding path program 1 times [2024-10-14 17:41:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915101383] [2024-10-14 17:41:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:15,676 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-14 17:41:15,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:15,677 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-14 17:41:15,678 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-14 17:41:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:15,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:41:15,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:15,828 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-14 17:41:15,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:15,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915101383] [2024-10-14 17:41:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915101383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:15,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:15,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:41:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677038521] [2024-10-14 17:41:15,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:41:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:41:15,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:41:15,862 INFO L87 Difference]: Start difference. First operand has 1172 states, 661 states have (on average 1.91981845688351) internal successors, (1269), 1165 states have internal predecessors, (1269), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:15,995 INFO L93 Difference]: Finished difference Result 1170 states and 2216 transitions. [2024-10-14 17:41:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:41:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:41:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:16,052 INFO L225 Difference]: With dead ends: 1170 [2024-10-14 17:41:16,053 INFO L226 Difference]: Without dead ends: 1169 [2024-10-14 17:41:16,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-14 17:41:16,057 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:16,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2212 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:41:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2024-10-14 17:41:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2024-10-14 17:41:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 660 states have (on average 1.8287878787878789) internal successors, (1207), 1162 states have internal predecessors, (1207), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-14 17:41:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 2215 transitions. [2024-10-14 17:41:16,420 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 2215 transitions. Word has length 6 [2024-10-14 17:41:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 2215 transitions. [2024-10-14 17:41:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 2215 transitions. [2024-10-14 17:41:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:41:16,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:16,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:41:16,427 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-14 17:41:16,626 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-14 17:41:16,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:16,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1312285046, now seen corresponding path program 1 times [2024-10-14 17:41:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:16,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141978915] [2024-10-14 17:41:16,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:16,628 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-14 17:41:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:16,630 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-14 17:41:16,631 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-14 17:41:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:16,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:41:16,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:16,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:41:16,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:41:16,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:41:16,815 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-14 17:41:16,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:41:16,908 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-14 17:41:16,921 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-14 17:41:16,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:16,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141978915] [2024-10-14 17:41:16,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141978915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:16,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:16,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:41:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616574304] [2024-10-14 17:41:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:41:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:41:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:41:16,925 INFO L87 Difference]: Start difference. First operand 1169 states and 2215 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:19,070 INFO L93 Difference]: Finished difference Result 2323 states and 4416 transitions. [2024-10-14 17:41:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:41:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:41:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:19,087 INFO L225 Difference]: With dead ends: 2323 [2024-10-14 17:41:19,087 INFO L226 Difference]: Without dead ends: 2323 [2024-10-14 17:41:19,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-14 17:41:19,090 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 1191 mSDsluCounter, 3953 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 6219 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:19,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 6219 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 17:41:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2024-10-14 17:41:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1171. [2024-10-14 17:41:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 662 states have (on average 1.8262839879154078) internal successors, (1209), 1164 states have internal predecessors, (1209), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-14 17:41:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2217 transitions. [2024-10-14 17:41:19,321 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2217 transitions. Word has length 8 [2024-10-14 17:41:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:19,322 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 2217 transitions. [2024-10-14 17:41:19,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2217 transitions. [2024-10-14 17:41:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 17:41:19,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:19,324 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, 1, 1, 1, 1] [2024-10-14 17:41:19,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:41:19,525 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-14 17:41:19,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:19,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 719312828, now seen corresponding path program 1 times [2024-10-14 17:41:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900378365] [2024-10-14 17:41:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:19,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:41:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:19,531 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-14 17:41:19,533 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-14 17:41:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:19,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:41:19,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:19,843 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-14 17:41:19,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:19,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900378365] [2024-10-14 17:41:19,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900378365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:19,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:19,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:41:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026857627] [2024-10-14 17:41:19,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:19,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:41:19,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:19,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:41:19,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:41:19,847 INFO L87 Difference]: Start difference. First operand 1171 states and 2217 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:19,994 INFO L93 Difference]: Finished difference Result 1174 states and 2212 transitions. [2024-10-14 17:41:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:41:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-14 17:41:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:20,000 INFO L225 Difference]: With dead ends: 1174 [2024-10-14 17:41:20,000 INFO L226 Difference]: Without dead ends: 1174 [2024-10-14 17:41:20,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-14 17:41:20,001 INFO L432 NwaCegarLoop]: 2182 mSDtfsCounter, 30 mSDsluCounter, 4347 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6529 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:20,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6529 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:41:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-10-14 17:41:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2024-10-14 17:41:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 665 states have (on average 1.8105263157894738) internal successors, (1204), 1167 states have internal predecessors, (1204), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-14 17:41:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 2212 transitions. [2024-10-14 17:41:20,105 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 2212 transitions. Word has length 64 [2024-10-14 17:41:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:20,105 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 2212 transitions. [2024-10-14 17:41:20,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 2212 transitions. [2024-10-14 17:41:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 17:41:20,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:20,107 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, 1, 1, 1, 1] [2024-10-14 17:41:20,115 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-14 17:41:20,307 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-14 17:41:20,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:20,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1821761744, now seen corresponding path program 1 times [2024-10-14 17:41:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416094132] [2024-10-14 17:41:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:20,309 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-14 17:41:20,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:20,311 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-14 17:41:20,312 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-14 17:41:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:20,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:41:20,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:20,858 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-14 17:41:20,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:20,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416094132] [2024-10-14 17:41:20,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416094132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:20,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:20,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:41:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605624853] [2024-10-14 17:41:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:20,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:41:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:20,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:41:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:41:20,860 INFO L87 Difference]: Start difference. First operand 1174 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:21,373 INFO L93 Difference]: Finished difference Result 2265 states and 4320 transitions. [2024-10-14 17:41:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:41:21,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-14 17:41:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:21,384 INFO L225 Difference]: With dead ends: 2265 [2024-10-14 17:41:21,384 INFO L226 Difference]: Without dead ends: 2265 [2024-10-14 17:41:21,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:41:21,385 INFO L432 NwaCegarLoop]: 2261 mSDtfsCounter, 1064 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:21,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 4449 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:41:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-10-14 17:41:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2261. [2024-10-14 17:41:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1252 states have (on average 1.8442492012779552) internal successors, (2309), 2254 states have internal predecessors, (2309), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-14 17:41:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 4317 transitions. [2024-10-14 17:41:21,600 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 4317 transitions. Word has length 64 [2024-10-14 17:41:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:21,601 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 4317 transitions. [2024-10-14 17:41:21,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:41:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 4317 transitions. [2024-10-14 17:41:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 17:41:21,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:21,603 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:41:21,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 17:41:21,807 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-14 17:41:21,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:21,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1241693433, now seen corresponding path program 1 times [2024-10-14 17:41:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491870091] [2024-10-14 17:41:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:21,810 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-14 17:41:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:21,812 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-14 17:41:21,814 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-14 17:41:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:22,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:41:22,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:22,171 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-14 17:41:22,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:22,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491870091] [2024-10-14 17:41:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491870091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:41:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403277152] [2024-10-14 17:41:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:41:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:22,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:41:22,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:41:22,174 INFO L87 Difference]: Start difference. First operand 2261 states and 4317 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:41:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:22,252 INFO L93 Difference]: Finished difference Result 2263 states and 4320 transitions. [2024-10-14 17:41:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:41:22,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2024-10-14 17:41:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:22,262 INFO L225 Difference]: With dead ends: 2263 [2024-10-14 17:41:22,263 INFO L226 Difference]: Without dead ends: 2263 [2024-10-14 17:41:22,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-14 17:41:22,263 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 0 mSDsluCounter, 4394 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6593 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:22,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6593 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:41:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2024-10-14 17:41:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2024-10-14 17:41:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1253 states have (on average 1.8443735035913806) internal successors, (2311), 2256 states have internal predecessors, (2311), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 4320 transitions. [2024-10-14 17:41:22,454 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 4320 transitions. Word has length 77 [2024-10-14 17:41:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:22,455 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 4320 transitions. [2024-10-14 17:41:22,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:41:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 4320 transitions. [2024-10-14 17:41:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 17:41:22,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:22,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:41:22,466 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 (6)] Forceful destruction successful, exit code 0 [2024-10-14 17:41:22,657 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-14 17:41:22,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:22,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1070495135, now seen corresponding path program 1 times [2024-10-14 17:41:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188508648] [2024-10-14 17:41:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:22,660 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-14 17:41:22,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:22,665 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-14 17:41:22,666 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-14 17:41:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:23,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:41:23,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:41:23,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:41:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:41:23,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188508648] [2024-10-14 17:41:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188508648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:41:23,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:41:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:41:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533565215] [2024-10-14 17:41:23,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:41:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:41:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:41:23,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:41:23,146 INFO L87 Difference]: Start difference. First operand 2263 states and 4320 transitions. Second operand has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:23,374 INFO L93 Difference]: Finished difference Result 2272 states and 4334 transitions. [2024-10-14 17:41:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:41:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 79 [2024-10-14 17:41:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:23,382 INFO L225 Difference]: With dead ends: 2272 [2024-10-14 17:41:23,383 INFO L226 Difference]: Without dead ends: 2272 [2024-10-14 17:41:23,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:41:23,384 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 5 mSDsluCounter, 8784 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10983 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:23,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10983 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:41:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-10-14 17:41:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2271. [2024-10-14 17:41:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 1260 states have (on average 1.8444444444444446) internal successors, (2324), 2263 states have internal predecessors, (2324), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 4333 transitions. [2024-10-14 17:41:23,645 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 4333 transitions. Word has length 79 [2024-10-14 17:41:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:23,645 INFO L471 AbstractCegarLoop]: Abstraction has 2271 states and 4333 transitions. [2024-10-14 17:41:23,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 4333 transitions. [2024-10-14 17:41:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 17:41:23,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:23,647 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-14 17:41:23,656 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 17:41:23,847 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-14 17:41:23,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:23,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 903074841, now seen corresponding path program 2 times [2024-10-14 17:41:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832070685] [2024-10-14 17:41:23,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:41:23,849 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-14 17:41:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:23,852 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-14 17:41:23,854 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-14 17:41:24,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:41:24,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:41:24,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:41:24,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:24,099 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:41:24,099 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:41:24,100 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:41:24,102 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-14 17:41:24,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:41:24,144 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-14 17:41:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:41:24,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:24,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832070685] [2024-10-14 17:41:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832070685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:24,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:24,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:41:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550571969] [2024-10-14 17:41:24,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:41:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:41:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:41:24,158 INFO L87 Difference]: Start difference. First operand 2271 states and 4333 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:26,379 INFO L93 Difference]: Finished difference Result 4387 states and 8484 transitions. [2024-10-14 17:41:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:41:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-10-14 17:41:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:26,398 INFO L225 Difference]: With dead ends: 4387 [2024-10-14 17:41:26,398 INFO L226 Difference]: Without dead ends: 4387 [2024-10-14 17:41:26,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-14 17:41:26,399 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 1176 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:26,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 6058 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 17:41:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2024-10-14 17:41:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 2273. [2024-10-14 17:41:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 1262 states have (on average 1.8431061806656102) internal successors, (2326), 2265 states have internal predecessors, (2326), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 4335 transitions. [2024-10-14 17:41:26,823 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 4335 transitions. Word has length 83 [2024-10-14 17:41:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 2273 states and 4335 transitions. [2024-10-14 17:41:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 4335 transitions. [2024-10-14 17:41:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 17:41:26,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:26,827 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 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-14 17:41:26,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:41:27,028 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-14 17:41:27,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1267285883, now seen corresponding path program 1 times [2024-10-14 17:41:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396129088] [2024-10-14 17:41:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:27,032 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-14 17:41:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:27,038 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-14 17:41:27,040 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-14 17:41:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:27,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:41:27,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:41:27,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:41:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:41:27,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396129088] [2024-10-14 17:41:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396129088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:41:27,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:41:27,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:41:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307248809] [2024-10-14 17:41:27,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:41:27,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:41:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:41:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:41:27,737 INFO L87 Difference]: Start difference. First operand 2273 states and 4335 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:28,347 INFO L93 Difference]: Finished difference Result 2285 states and 4354 transitions. [2024-10-14 17:41:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:41:28,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2024-10-14 17:41:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:28,362 INFO L225 Difference]: With dead ends: 2285 [2024-10-14 17:41:28,362 INFO L226 Difference]: Without dead ends: 2283 [2024-10-14 17:41:28,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:41:28,363 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 7 mSDsluCounter, 13177 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15376 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:28,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15376 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:41:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2024-10-14 17:41:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2282. [2024-10-14 17:41:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 1271 states have (on average 1.839496459480724) internal successors, (2338), 2274 states have internal predecessors, (2338), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 4347 transitions. [2024-10-14 17:41:28,571 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 4347 transitions. Word has length 122 [2024-10-14 17:41:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:28,572 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 4347 transitions. [2024-10-14 17:41:28,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 4347 transitions. [2024-10-14 17:41:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 17:41:28,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:28,573 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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-14 17:41:28,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:41:28,774 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-14 17:41:28,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 208563022, now seen corresponding path program 2 times [2024-10-14 17:41:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438159576] [2024-10-14 17:41:28,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:41:28,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:41:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:28,779 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-14 17:41:28,780 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-14 17:41:29,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:41:29,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:41:29,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:41:29,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-14 17:41:29,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:29,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438159576] [2024-10-14 17:41:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438159576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:41:29,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509638745] [2024-10-14 17:41:29,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:29,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:41:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:29,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:41:29,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:41:29,067 INFO L87 Difference]: Start difference. First operand 2282 states and 4347 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:29,204 INFO L93 Difference]: Finished difference Result 2288 states and 4337 transitions. [2024-10-14 17:41:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:41:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-10-14 17:41:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:29,212 INFO L225 Difference]: With dead ends: 2288 [2024-10-14 17:41:29,212 INFO L226 Difference]: Without dead ends: 2288 [2024-10-14 17:41:29,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-14 17:41:29,214 INFO L432 NwaCegarLoop]: 2171 mSDtfsCounter, 30 mSDsluCounter, 4325 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6496 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:29,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6496 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:41:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2024-10-14 17:41:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2288. [2024-10-14 17:41:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 1277 states have (on average 1.8230227094753328) internal successors, (2328), 2280 states have internal predecessors, (2328), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 4337 transitions. [2024-10-14 17:41:29,390 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 4337 transitions. Word has length 131 [2024-10-14 17:41:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:29,391 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 4337 transitions. [2024-10-14 17:41:29,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 4337 transitions. [2024-10-14 17:41:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 17:41:29,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:29,392 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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-14 17:41:29,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:41:29,593 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-14 17:41:29,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1558492866, now seen corresponding path program 1 times [2024-10-14 17:41:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202804943] [2024-10-14 17:41:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:29,594 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-14 17:41:29,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:29,595 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-14 17:41:29,596 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-14 17:41:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:30,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:41:30,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:41:30,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:41:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:41:30,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:30,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202804943] [2024-10-14 17:41:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202804943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:41:30,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:41:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:41:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551417312] [2024-10-14 17:41:30,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:41:30,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:41:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:41:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:41:30,857 INFO L87 Difference]: Start difference. First operand 2288 states and 4337 transitions. Second operand has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:32,627 INFO L93 Difference]: Finished difference Result 2309 states and 4374 transitions. [2024-10-14 17:41:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:41:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-14 17:41:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:32,636 INFO L225 Difference]: With dead ends: 2309 [2024-10-14 17:41:32,640 INFO L226 Difference]: Without dead ends: 2307 [2024-10-14 17:41:32,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:41:32,641 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 14 mSDsluCounter, 24037 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26225 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:32,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26225 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 17:41:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2024-10-14 17:41:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2306. [2024-10-14 17:41:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 1295 states have (on average 1.8162162162162163) internal successors, (2352), 2298 states have internal predecessors, (2352), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 4361 transitions. [2024-10-14 17:41:32,811 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 4361 transitions. Word has length 131 [2024-10-14 17:41:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:32,811 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 4361 transitions. [2024-10-14 17:41:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 4361 transitions. [2024-10-14 17:41:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 17:41:32,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:32,812 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 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-14 17:41:32,825 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-14 17:41:33,013 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-14 17:41:33,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1602853922, now seen corresponding path program 2 times [2024-10-14 17:41:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116049998] [2024-10-14 17:41:33,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:41:33,015 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-14 17:41:33,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:33,016 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-14 17:41:33,017 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-14 17:41:33,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:41:33,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:41:33,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:41:33,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-14 17:41:33,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:33,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116049998] [2024-10-14 17:41:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116049998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:41:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023404999] [2024-10-14 17:41:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:33,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:41:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:33,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:41:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:41:33,327 INFO L87 Difference]: Start difference. First operand 2306 states and 4361 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:33,442 INFO L93 Difference]: Finished difference Result 2306 states and 4355 transitions. [2024-10-14 17:41:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:41:33,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 149 [2024-10-14 17:41:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:33,453 INFO L225 Difference]: With dead ends: 2306 [2024-10-14 17:41:33,454 INFO L226 Difference]: Without dead ends: 2306 [2024-10-14 17:41:33,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:41:33,455 INFO L432 NwaCegarLoop]: 2184 mSDtfsCounter, 0 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:33,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4347 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:41:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-10-14 17:41:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2024-10-14 17:41:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 1295 states have (on average 1.8115830115830116) internal successors, (2346), 2298 states have internal predecessors, (2346), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 4355 transitions. [2024-10-14 17:41:33,646 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 4355 transitions. Word has length 149 [2024-10-14 17:41:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:33,646 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 4355 transitions. [2024-10-14 17:41:33,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 4355 transitions. [2024-10-14 17:41:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 17:41:33,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:33,649 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 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-14 17:41:33,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 17:41:33,849 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-14 17:41:33,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:33,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1671045020, now seen corresponding path program 1 times [2024-10-14 17:41:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:33,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346534] [2024-10-14 17:41:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:41:33,851 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-14 17:41:33,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:33,854 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-14 17:41:33,854 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-14 17:41:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:41:34,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:41:34,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:41:34,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:41:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:41:36,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:36,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346534] [2024-10-14 17:41:36,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346534] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:41:36,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:41:36,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:41:36,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904444679] [2024-10-14 17:41:36,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:41:36,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:41:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:36,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:41:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:41:36,247 INFO L87 Difference]: Start difference. First operand 2306 states and 4355 transitions. Second operand has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:41,498 INFO L93 Difference]: Finished difference Result 2343 states and 4424 transitions. [2024-10-14 17:41:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:41:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 149 [2024-10-14 17:41:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:41,505 INFO L225 Difference]: With dead ends: 2343 [2024-10-14 17:41:41,506 INFO L226 Difference]: Without dead ends: 2341 [2024-10-14 17:41:41,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:41:41,507 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 25 mSDsluCounter, 56810 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58998 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:41,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 58998 Invalid, 2071 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 17:41:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2024-10-14 17:41:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2340. [2024-10-14 17:41:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 1329 states have (on average 1.799849510910459) internal successors, (2392), 2332 states have internal predecessors, (2392), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 4401 transitions. [2024-10-14 17:41:41,671 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 4401 transitions. Word has length 149 [2024-10-14 17:41:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:41,671 INFO L471 AbstractCegarLoop]: Abstraction has 2340 states and 4401 transitions. [2024-10-14 17:41:41,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:41:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 4401 transitions. [2024-10-14 17:41:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 17:41:41,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:41,673 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 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-14 17:41:41,687 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-14 17:41:41,873 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-14 17:41:41,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:41,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash 446816516, now seen corresponding path program 2 times [2024-10-14 17:41:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869232214] [2024-10-14 17:41:41,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:41:41,875 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-14 17:41:41,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:41,878 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-14 17:41:41,879 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-14 17:41:42,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:41:42,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:41:42,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:41:42,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:41:43,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:41:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:41:44,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869232214] [2024-10-14 17:41:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869232214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:41:44,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:41:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:41:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242382389] [2024-10-14 17:41:44,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:41:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:41:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:44,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:41:44,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:41:44,667 INFO L87 Difference]: Start difference. First operand 2340 states and 4401 transitions. Second operand has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:41:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:50,953 INFO L93 Difference]: Finished difference Result 2367 states and 4453 transitions. [2024-10-14 17:41:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:41:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 183 [2024-10-14 17:41:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:50,960 INFO L225 Difference]: With dead ends: 2367 [2024-10-14 17:41:50,961 INFO L226 Difference]: Without dead ends: 2367 [2024-10-14 17:41:50,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:41:50,963 INFO L432 NwaCegarLoop]: 2187 mSDtfsCounter, 26 mSDsluCounter, 56788 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 58975 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:50,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 58975 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 17:41:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-10-14 17:41:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2365. [2024-10-14 17:41:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1354 states have (on average 1.8035450516986706) internal successors, (2442), 2357 states have internal predecessors, (2442), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-14 17:41:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 4451 transitions. [2024-10-14 17:41:51,161 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 4451 transitions. Word has length 183 [2024-10-14 17:41:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:51,162 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 4451 transitions. [2024-10-14 17:41:51,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:41:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 4451 transitions. [2024-10-14 17:41:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 17:41:51,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:51,163 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 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-14 17:41:51,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:41:51,364 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-14 17:41:51,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:51,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 904570779, now seen corresponding path program 3 times [2024-10-14 17:41:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067180109] [2024-10-14 17:41:51,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:41:51,366 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-14 17:41:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:51,367 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-14 17:41:51,368 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-14 17:41:51,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:41:51,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:41:51,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:41:51,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4373 trivial. 0 not checked. [2024-10-14 17:41:52,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:41:52,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067180109] [2024-10-14 17:41:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067180109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:41:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:41:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:41:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679899014] [2024-10-14 17:41:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:41:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:41:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:41:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:41:52,149 INFO L87 Difference]: Start difference. First operand 2365 states and 4451 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:41:56,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:42:00,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:42:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:42:02,686 INFO L93 Difference]: Finished difference Result 1317 states and 2398 transitions. [2024-10-14 17:42:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:42:02,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 208 [2024-10-14 17:42:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:42:02,692 INFO L225 Difference]: With dead ends: 1317 [2024-10-14 17:42:02,692 INFO L226 Difference]: Without dead ends: 1317 [2024-10-14 17:42:02,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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-14 17:42:02,692 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 2243 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1003 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:42:02,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 3259 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-10-14 17:42:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-10-14 17:42:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2024-10-14 17:42:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 806 states have (on average 1.7233250620347396) internal successors, (1389), 1309 states have internal predecessors, (1389), 505 states have call successors, (505), 4 states have call predecessors, (505), 4 states have return successors, (504), 4 states have call predecessors, (504), 503 states have call successors, (504) [2024-10-14 17:42:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 2398 transitions. [2024-10-14 17:42:02,800 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 2398 transitions. Word has length 208 [2024-10-14 17:42:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:42:02,800 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 2398 transitions. [2024-10-14 17:42:02,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:42:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 2398 transitions. [2024-10-14 17:42:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 17:42:02,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:42:02,802 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:42:02,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 17:42:03,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:42:03,002 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:42:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:42:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1710605467, now seen corresponding path program 1 times [2024-10-14 17:42:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:42:03,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3989145] [2024-10-14 17:42:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:42:03,005 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-14 17:42:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:42:03,006 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:42:03,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 17:42:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:42:04,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:42:04,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:42:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:42:05,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:42:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:42:11,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:42:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3989145] [2024-10-14 17:42:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3989145] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:42:11,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:42:11,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:42:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922717064] [2024-10-14 17:42:11,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:42:11,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:42:11,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:42:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:42:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:42:11,478 INFO L87 Difference]: Start difference. First operand 1317 states and 2398 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)