./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:11:38,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:11:38,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-22 18:11:38,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:11:38,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:11:38,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:11:38,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:11:38,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:11:38,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:11:38,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:11:38,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:11:38,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:11:38,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:11:38,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:11:38,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:11:38,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:11:38,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:11:38,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:11:38,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:11:38,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:11:38,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:11:38,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:11:38,887 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:11:38,887 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:11:38,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:11:38,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:11:38,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:11:38,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:11:38,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:11:38,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:11:38,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:11:38,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:11:38,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:11:38,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:11:38,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:11:38,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:11:38,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:11:38,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:11:38,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:11:38,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:11:38,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:11:38,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:11:38,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:11:38,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:11:38,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:11:38,891 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-22 18:11:39,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:11:39,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:11:39,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:11:39,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:11:39,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:11:39,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-22 18:11:40,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:11:40,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:11:40,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-22 18:11:40,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6070c08cf/68afa27ff24e4b4089f0dd6ba554c219/FLAG366fb9bd0 [2024-11-22 18:11:40,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6070c08cf/68afa27ff24e4b4089f0dd6ba554c219 [2024-11-22 18:11:40,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:11:40,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:11:40,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:11:40,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:11:40,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:11:40,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:11:40" (1/1) ... [2024-11-22 18:11:40,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1009fe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:40, skipping insertion in model container [2024-11-22 18:11:40,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:11:40" (1/1) ... [2024-11-22 18:11:40,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:11:41,336 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,364 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,370 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,415 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,418 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,420 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,421 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,422 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,424 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,428 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:41,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:11:41,452 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-22 18:11:41,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a49816f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:41, skipping insertion in model container [2024-11-22 18:11:41,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:11:41,453 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:11:41,455 INFO L158 Benchmark]: Toolchain (without parser) took 545.64ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 56.1MB in the beginning and 130.8MB in the end (delta: -74.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-22 18:11:41,456 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 127.9MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:11:41,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.38ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 55.8MB in the beginning and 130.8MB in the end (delta: -75.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-22 18:11:41,458 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 127.9MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.38ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 55.8MB in the beginning and 130.8MB in the end (delta: -75.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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 ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:11:43,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:11:43,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-22 18:11:43,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:11:43,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:11:43,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:11:43,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:11:43,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:11:43,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:11:43,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:11:43,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:11:43,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:11:43,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:11:43,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:11:43,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:11:43,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:11:43,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:11:43,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:11:43,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:11:43,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:11:43,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:11:43,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:11:43,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:11:43,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:11:43,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:11:43,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:11:43,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:11:43,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:11:43,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:11:43,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:11:43,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:11:43,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:11:43,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:11:43,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:11:43,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:11:43,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:11:43,269 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:11:43,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:11:43,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:11:43,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:11:43,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:11:43,270 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-22 18:11:43,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:11:43,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:11:43,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:11:43,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:11:43,564 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:11:43,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-22 18:11:44,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:11:45,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:11:45,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-22 18:11:45,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46027b2f/8258f4e1e353463d9770d63f14229943/FLAG60adc74bf [2024-11-22 18:11:45,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46027b2f/8258f4e1e353463d9770d63f14229943 [2024-11-22 18:11:45,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:11:45,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:11:45,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:11:45,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:11:45,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:11:45,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:11:45" (1/1) ... [2024-11-22 18:11:45,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ec72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:45, skipping insertion in model container [2024-11-22 18:11:45,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:11:45" (1/1) ... [2024-11-22 18:11:45,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:11:45,912 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:45,944 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:45,949 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:45,956 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:45,964 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:45,994 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:45,998 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,000 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,003 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,005 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,009 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,012 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,013 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,019 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:11:46,041 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:11:46,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:11:46,077 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,086 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,087 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,089 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,092 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,112 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,112 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:11:46,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:11:46,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:11:46,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:11:46,252 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:11:46,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46 WrapperNode [2024-11-22 18:11:46,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:11:46,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:11:46,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:11:46,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:11:46,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,356 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2024-11-22 18:11:46,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:11:46,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:11:46,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:11:46,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:11:46,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,424 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-22 18:11:46,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:11:46,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:11:46,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:11:46,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:11:46,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (1/1) ... [2024-11-22 18:11:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:11:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:11:46,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:11:46,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:11:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 18:11:46,557 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 18:11:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 18:11:46,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 18:11:46,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 18:11:46,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:11:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 18:11:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 18:11:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 18:11:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 18:11:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 18:11:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:11:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:11:46,736 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:11:46,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:11:54,120 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-22 18:11:54,120 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:11:54,132 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:11:54,132 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-22 18:11:54,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:11:54 BoogieIcfgContainer [2024-11-22 18:11:54,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:11:54,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:11:54,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:11:54,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:11:54,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:11:45" (1/3) ... [2024-11-22 18:11:54,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314c102f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:11:54, skipping insertion in model container [2024-11-22 18:11:54,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:11:46" (2/3) ... [2024-11-22 18:11:54,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314c102f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:11:54, skipping insertion in model container [2024-11-22 18:11:54,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:11:54" (3/3) ... [2024-11-22 18:11:54,148 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2024-11-22 18:11:54,162 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:11:54,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 18:11:54,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:11:54,216 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;@3778fb42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:11:54,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 18:11:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 187 states have (on average 1.6684491978609626) internal successors, (312), 190 states have internal predecessors, (312), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:11:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:11:54,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:54,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:11:54,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:54,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 253905471, now seen corresponding path program 1 times [2024-11-22 18:11:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:54,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631965401] [2024-11-22 18:11:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:11:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:54,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:54,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 18:11:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:11:54,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 18:11:54,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:11:54,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:11:54,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631965401] [2024-11-22 18:11:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631965401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:11:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:11:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:11:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681768660] [2024-11-22 18:11:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:11:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:11:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:11:54,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:11:54,453 INFO L87 Difference]: Start difference. First operand has 197 states, 187 states have (on average 1.6684491978609626) internal successors, (312), 190 states have internal predecessors, (312), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-22 18:11:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:54,477 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2024-11-22 18:11:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:11:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-22 18:11:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:54,486 INFO L225 Difference]: With dead ends: 194 [2024-11-22 18:11:54,487 INFO L226 Difference]: Without dead ends: 192 [2024-11-22 18:11:54,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:11:54,491 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:54,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:11:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-22 18:11:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-22 18:11:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 184 states have (on average 1.298913043478261) internal successors, (239), 186 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:11:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2024-11-22 18:11:54,583 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 9 [2024-11-22 18:11:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:54,583 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2024-11-22 18:11:54,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11-22 18:11:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2024-11-22 18:11:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:11:54,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:54,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:11:54,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 18:11:54,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:54,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1725709565, now seen corresponding path program 1 times [2024-11-22 18:11:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737730076] [2024-11-22 18:11:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:11:54,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:54,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:54,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:54,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 18:11:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:11:54,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:11:54,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:54,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:11:54,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:11:54,980 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 33 treesize of output 31 [2024-11-22 18:11:55,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:11:55,037 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 62 treesize of output 22 [2024-11-22 18:11:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:11:55,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:11:55,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737730076] [2024-11-22 18:11:55,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737730076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:11:55,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:11:55,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:11:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108288417] [2024-11-22 18:11:55,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:11:55,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:11:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:11:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:11:55,069 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-22 18:11:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:55,652 INFO L93 Difference]: Finished difference Result 372 states and 483 transitions. [2024-11-22 18:11:55,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:11:55,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-22 18:11:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:55,655 INFO L225 Difference]: With dead ends: 372 [2024-11-22 18:11:55,656 INFO L226 Difference]: Without dead ends: 372 [2024-11-22 18:11:55,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:11:55,657 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 225 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:55,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 727 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:11:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-22 18:11:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 194. [2024-11-22 18:11:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 1.2956989247311828) internal successors, (241), 188 states have internal predecessors, (241), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:11:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 249 transitions. [2024-11-22 18:11:55,672 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 249 transitions. Word has length 11 [2024-11-22 18:11:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:55,673 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 249 transitions. [2024-11-22 18:11:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-22 18:11:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2024-11-22 18:11:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 18:11:55,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:55,675 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, 1, 1, 1] [2024-11-22 18:11:55,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 18:11:55,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:55,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1334240943, now seen corresponding path program 1 times [2024-11-22 18:11:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584609275] [2024-11-22 18:11:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:11:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:55,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:55,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:55,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 18:11:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:11:56,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:11:56,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:11:56,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:11:56,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584609275] [2024-11-22 18:11:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584609275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:11:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:11:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:11:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031523957] [2024-11-22 18:11:56,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:11:56,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:11:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:11:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:11:56,215 INFO L87 Difference]: Start difference. First operand 194 states and 249 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-22 18:11:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:56,324 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2024-11-22 18:11:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:11:56,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2024-11-22 18:11:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:56,326 INFO L225 Difference]: With dead ends: 197 [2024-11-22 18:11:56,326 INFO L226 Difference]: Without dead ends: 197 [2024-11-22 18:11:56,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-11-22 18:11:56,327 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 30 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:56,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 632 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:11:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-22 18:11:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-22 18:11:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 191 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:11:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2024-11-22 18:11:56,342 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 67 [2024-11-22 18:11:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:56,345 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2024-11-22 18:11:56,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-22 18:11:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2024-11-22 18:11:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 18:11:56,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:56,347 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, 1, 1, 1] [2024-11-22 18:11:56,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 18:11:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:56,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:56,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1096998621, now seen corresponding path program 1 times [2024-11-22 18:11:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38358149] [2024-11-22 18:11:56,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:11:56,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:56,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:56,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:56,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 18:11:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:11:56,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:11:56,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:11:57,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:11:57,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38358149] [2024-11-22 18:11:57,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38358149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:11:57,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:11:57,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:11:57,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418941832] [2024-11-22 18:11:57,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:11:57,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:11:57,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:57,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:11:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:11:57,065 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-11-22 18:11:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:57,565 INFO L93 Difference]: Finished difference Result 308 states and 381 transitions. [2024-11-22 18:11:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:11:57,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2024-11-22 18:11:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:57,568 INFO L225 Difference]: With dead ends: 308 [2024-11-22 18:11:57,568 INFO L226 Difference]: Without dead ends: 308 [2024-11-22 18:11:57,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-11-22 18:11:57,569 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 90 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:57,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 490 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:11:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-22 18:11:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-11-22 18:11:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 297 states have (on average 1.245791245791246) internal successors, (370), 299 states have internal predecessors, (370), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:11:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 378 transitions. [2024-11-22 18:11:57,577 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 378 transitions. Word has length 67 [2024-11-22 18:11:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:57,578 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 378 transitions. [2024-11-22 18:11:57,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-11-22 18:11:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 378 transitions. [2024-11-22 18:11:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-22 18:11:57,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:57,580 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, 1, 1, 1] [2024-11-22 18:11:57,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 18:11:57,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:57,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:57,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1043702760, now seen corresponding path program 1 times [2024-11-22 18:11:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864927930] [2024-11-22 18:11:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:11:57,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:57,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:57,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 18:11:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:11:58,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:11:58,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:11:58,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:11:58,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864927930] [2024-11-22 18:11:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864927930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:11:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:11:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:11:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651965944] [2024-11-22 18:11:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:11:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:11:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:11:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:11:58,164 INFO L87 Difference]: Start difference. First operand 305 states and 378 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-11-22 18:11:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:58,195 INFO L93 Difference]: Finished difference Result 308 states and 382 transitions. [2024-11-22 18:11:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:11:58,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 82 [2024-11-22 18:11:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:58,199 INFO L225 Difference]: With dead ends: 308 [2024-11-22 18:11:58,199 INFO L226 Difference]: Without dead ends: 308 [2024-11-22 18:11:58,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:11:58,200 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:58,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 695 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:11:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-22 18:11:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-22 18:11:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 302 states have internal predecessors, (373), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:11:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 382 transitions. [2024-11-22 18:11:58,213 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 382 transitions. Word has length 82 [2024-11-22 18:11:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:58,214 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 382 transitions. [2024-11-22 18:11:58,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-11-22 18:11:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 382 transitions. [2024-11-22 18:11:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 18:11:58,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:58,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:11:58,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 18:11:58,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:58,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:58,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash -388445802, now seen corresponding path program 1 times [2024-11-22 18:11:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636587150] [2024-11-22 18:11:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:11:58,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:58,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:58,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:58,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 18:11:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:11:58,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:11:58,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:11:58,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:11:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:11:58,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636587150] [2024-11-22 18:11:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636587150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:11:58,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:11:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 18:11:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587070047] [2024-11-22 18:11:58,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:11:58,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:11:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:11:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:11:58,906 INFO L87 Difference]: Start difference. First operand 308 states and 382 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-11-22 18:11:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:59,053 INFO L93 Difference]: Finished difference Result 319 states and 398 transitions. [2024-11-22 18:11:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:11:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 84 [2024-11-22 18:11:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:59,055 INFO L225 Difference]: With dead ends: 319 [2024-11-22 18:11:59,055 INFO L226 Difference]: Without dead ends: 319 [2024-11-22 18:11:59,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 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-11-22 18:11:59,056 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:59,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:11:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-22 18:11:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-11-22 18:11:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 307 states have (on average 1.260586319218241) internal successors, (387), 310 states have internal predecessors, (387), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:11:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 396 transitions. [2024-11-22 18:11:59,061 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 396 transitions. Word has length 84 [2024-11-22 18:11:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:59,062 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 396 transitions. [2024-11-22 18:11:59,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-11-22 18:11:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 396 transitions. [2024-11-22 18:11:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-22 18:11:59,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:59,063 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:11:59,082 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-11-22 18:11:59,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:59,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:11:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:11:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1144462136, now seen corresponding path program 2 times [2024-11-22 18:11:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:11:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559914699] [2024-11-22 18:11:59,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:11:59,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:11:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:11:59,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:11:59,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 18:11:59,495 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:11:59,495 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:11:59,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:11:59,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:11:59,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:11:59,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:11:59,530 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:11:59,532 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-11-22 18:11:59,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:11:59,567 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-11-22 18:11:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-22 18:11:59,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:11:59,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:11:59,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559914699] [2024-11-22 18:11:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559914699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:11:59,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:11:59,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:11:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583278948] [2024-11-22 18:11:59,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:11:59,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:11:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:11:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:11:59,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:11:59,581 INFO L87 Difference]: Start difference. First operand 317 states and 396 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-22 18:11:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:11:59,964 INFO L93 Difference]: Finished difference Result 477 states and 607 transitions. [2024-11-22 18:11:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:11:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 88 [2024-11-22 18:11:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:11:59,966 INFO L225 Difference]: With dead ends: 477 [2024-11-22 18:11:59,966 INFO L226 Difference]: Without dead ends: 477 [2024-11-22 18:11:59,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-11-22 18:11:59,967 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 207 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:11:59,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 697 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:11:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-22 18:11:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 319. [2024-11-22 18:11:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 309 states have (on average 1.2588996763754046) internal successors, (389), 312 states have internal predecessors, (389), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:11:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 398 transitions. [2024-11-22 18:11:59,979 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 398 transitions. Word has length 88 [2024-11-22 18:11:59,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:11:59,980 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 398 transitions. [2024-11-22 18:11:59,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-22 18:11:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 398 transitions. [2024-11-22 18:11:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-22 18:11:59,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:11:59,981 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:11:59,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 18:12:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:00,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:00,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1070507670, now seen corresponding path program 1 times [2024-11-22 18:12:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913140347] [2024-11-22 18:12:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:12:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:00,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:00,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 18:12:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:12:00,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:12:00,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:12:00,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:12:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:12:00,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:00,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913140347] [2024-11-22 18:12:00,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913140347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:12:00,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:12:00,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 18:12:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446699102] [2024-11-22 18:12:00,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:12:00,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:12:00,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:00,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:12:00,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:12:00,843 INFO L87 Difference]: Start difference. First operand 319 states and 398 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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-11-22 18:12:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:01,287 INFO L93 Difference]: Finished difference Result 334 states and 420 transitions. [2024-11-22 18:12:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:12:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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 125 [2024-11-22 18:12:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:01,289 INFO L225 Difference]: With dead ends: 334 [2024-11-22 18:12:01,289 INFO L226 Difference]: Without dead ends: 330 [2024-11-22 18:12:01,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:12:01,290 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 8 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:01,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1619 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:12:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-22 18:12:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-11-22 18:12:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 318 states have (on average 1.2610062893081762) internal successors, (401), 321 states have internal predecessors, (401), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2024-11-22 18:12:01,300 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 125 [2024-11-22 18:12:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:01,301 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2024-11-22 18:12:01,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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-11-22 18:12:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2024-11-22 18:12:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 18:12:01,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:01,302 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:01,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-22 18:12:01,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:01,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1989466845, now seen corresponding path program 2 times [2024-11-22 18:12:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:01,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410171787] [2024-11-22 18:12:01,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:12:01,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:01,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:01,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 18:12:01,751 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:12:01,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:12:01,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:12:01,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-22 18:12:01,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:12:01,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410171787] [2024-11-22 18:12:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410171787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:12:01,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:12:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:12:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568990484] [2024-11-22 18:12:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:12:01,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:12:01,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:12:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:12:01,779 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-11-22 18:12:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:01,878 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2024-11-22 18:12:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:12:01,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 134 [2024-11-22 18:12:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:01,883 INFO L225 Difference]: With dead ends: 334 [2024-11-22 18:12:01,883 INFO L226 Difference]: Without dead ends: 334 [2024-11-22 18:12:01,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-11-22 18:12:01,884 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 30 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:01,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 599 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:12:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-22 18:12:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-22 18:12:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.2067901234567902) internal successors, (391), 327 states have internal predecessors, (391), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 400 transitions. [2024-11-22 18:12:01,891 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 400 transitions. Word has length 134 [2024-11-22 18:12:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:01,891 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 400 transitions. [2024-11-22 18:12:01,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-11-22 18:12:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2024-11-22 18:12:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 18:12:01,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:01,892 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:01,897 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-11-22 18:12:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:02,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:02,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -639537001, now seen corresponding path program 1 times [2024-11-22 18:12:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051372865] [2024-11-22 18:12:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:12:02,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:02,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:02,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 18:12:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:12:02,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:12:02,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:12:02,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:12:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 18:12:03,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051372865] [2024-11-22 18:12:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051372865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:12:03,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:12:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 18:12:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072787252] [2024-11-22 18:12:03,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:12:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 18:12:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 18:12:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 18:12:03,191 INFO L87 Difference]: Start difference. First operand 334 states and 400 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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-11-22 18:12:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:04,590 INFO L93 Difference]: Finished difference Result 358 states and 440 transitions. [2024-11-22 18:12:04,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 18:12:04,591 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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 134 [2024-11-22 18:12:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:04,593 INFO L225 Difference]: With dead ends: 358 [2024-11-22 18:12:04,594 INFO L226 Difference]: Without dead ends: 354 [2024-11-22 18:12:04,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 18:12:04,595 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 13 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:04,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2646 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:12:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-22 18:12:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-11-22 18:12:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.213450292397661) internal successors, (415), 345 states have internal predecessors, (415), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 424 transitions. [2024-11-22 18:12:04,603 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 424 transitions. Word has length 134 [2024-11-22 18:12:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:04,603 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 424 transitions. [2024-11-22 18:12:04,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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-11-22 18:12:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2024-11-22 18:12:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-22 18:12:04,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:04,605 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:04,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-22 18:12:04,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:04,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:04,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash -747182601, now seen corresponding path program 2 times [2024-11-22 18:12:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226874799] [2024-11-22 18:12:04,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:12:04,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:04,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:04,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:04,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 18:12:05,084 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:12:05,085 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:12:05,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:12:05,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-22 18:12:05,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:12:05,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226874799] [2024-11-22 18:12:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226874799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:12:05,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:12:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:12:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609716318] [2024-11-22 18:12:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:12:05,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:12:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:12:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:12:05,114 INFO L87 Difference]: Start difference. First operand 352 states and 424 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-22 18:12:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:05,165 INFO L93 Difference]: Finished difference Result 352 states and 418 transitions. [2024-11-22 18:12:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:12:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 152 [2024-11-22 18:12:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:05,167 INFO L225 Difference]: With dead ends: 352 [2024-11-22 18:12:05,168 INFO L226 Difference]: Without dead ends: 352 [2024-11-22 18:12:05,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-11-22 18:12:05,168 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:05,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:12:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-22 18:12:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-22 18:12:05,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.195906432748538) internal successors, (409), 345 states have internal predecessors, (409), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 418 transitions. [2024-11-22 18:12:05,175 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 418 transitions. Word has length 152 [2024-11-22 18:12:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:05,175 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 418 transitions. [2024-11-22 18:12:05,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-11-22 18:12:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 418 transitions. [2024-11-22 18:12:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-22 18:12:05,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:05,177 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:05,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:12:05,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:05,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:05,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash 273885753, now seen corresponding path program 1 times [2024-11-22 18:12:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884900932] [2024-11-22 18:12:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:12:05,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:05,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:05,382 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:05,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 18:12:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:12:05,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 18:12:05,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-22 18:12:06,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:12:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-22 18:12:07,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884900932] [2024-11-22 18:12:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884900932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:12:07,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:12:07,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 18:12:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318112385] [2024-11-22 18:12:07,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:12:07,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 18:12:07,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 18:12:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 18:12:07,824 INFO L87 Difference]: Start difference. First operand 352 states and 418 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-11-22 18:12:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:12,893 INFO L93 Difference]: Finished difference Result 392 states and 490 transitions. [2024-11-22 18:12:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 18:12:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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 152 [2024-11-22 18:12:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:12,895 INFO L225 Difference]: With dead ends: 392 [2024-11-22 18:12:12,895 INFO L226 Difference]: Without dead ends: 388 [2024-11-22 18:12:12,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 18:12:12,897 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 26 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:12,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5720 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 18:12:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-22 18:12:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-22 18:12:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 376 states have (on average 1.2101063829787233) internal successors, (455), 379 states have internal predecessors, (455), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 464 transitions. [2024-11-22 18:12:12,904 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 464 transitions. Word has length 152 [2024-11-22 18:12:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 464 transitions. [2024-11-22 18:12:12,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-11-22 18:12:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 464 transitions. [2024-11-22 18:12:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-22 18:12:12,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:12,906 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:12,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-22 18:12:13,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:13,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 94876633, now seen corresponding path program 2 times [2024-11-22 18:12:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742324424] [2024-11-22 18:12:13,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:12:13,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:13,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:13,109 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:13,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 18:12:14,078 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:12:14,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:12:14,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:12:14,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-22 18:12:14,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:12:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-22 18:12:15,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742324424] [2024-11-22 18:12:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742324424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:12:15,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:12:15,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-22 18:12:15,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290989216] [2024-11-22 18:12:15,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:12:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 18:12:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 18:12:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-22 18:12:15,904 INFO L87 Difference]: Start difference. First operand 386 states and 464 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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-11-22 18:12:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:20,797 INFO L93 Difference]: Finished difference Result 415 states and 518 transitions. [2024-11-22 18:12:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-22 18:12:20,798 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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 186 [2024-11-22 18:12:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:20,800 INFO L225 Difference]: With dead ends: 415 [2024-11-22 18:12:20,800 INFO L226 Difference]: Without dead ends: 415 [2024-11-22 18:12:20,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-22 18:12:20,803 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 27 mSDsluCounter, 5477 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:20,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5698 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 18:12:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-22 18:12:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2024-11-22 18:12:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 401 states have (on average 1.259351620947631) internal successors, (505), 404 states have internal predecessors, (505), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 514 transitions. [2024-11-22 18:12:20,810 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 514 transitions. Word has length 186 [2024-11-22 18:12:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:20,810 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 514 transitions. [2024-11-22 18:12:20,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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-11-22 18:12:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 514 transitions. [2024-11-22 18:12:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-22 18:12:20,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:20,812 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:20,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 (14)] Ended with exit code 0 [2024-11-22 18:12:21,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:21,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash -402225536, now seen corresponding path program 3 times [2024-11-22 18:12:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854677590] [2024-11-22 18:12:21,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:12:21,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:21,017 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:21,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-22 18:12:21,534 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 18:12:21,534 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:12:21,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:12:21,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-22 18:12:21,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:12:21,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854677590] [2024-11-22 18:12:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854677590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:12:21,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:12:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:12:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962388852] [2024-11-22 18:12:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:12:21,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:12:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:12:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:12:21,719 INFO L87 Difference]: Start difference. First operand 411 states and 514 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-22 18:12:26,117 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-11-22 18:12:30,122 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-11-22 18:12:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:12:31,385 INFO L93 Difference]: Finished difference Result 502 states and 621 transitions. [2024-11-22 18:12:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:12:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 211 [2024-11-22 18:12:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:12:31,388 INFO L225 Difference]: With dead ends: 502 [2024-11-22 18:12:31,389 INFO L226 Difference]: Without dead ends: 502 [2024-11-22 18:12:31,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 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-11-22 18:12:31,389 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 396 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:12:31,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 387 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2024-11-22 18:12:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-22 18:12:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-22 18:12:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 489 states have (on average 1.2453987730061349) internal successors, (609), 492 states have internal predecessors, (609), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:12:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 618 transitions. [2024-11-22 18:12:31,398 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 618 transitions. Word has length 211 [2024-11-22 18:12:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:12:31,398 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 618 transitions. [2024-11-22 18:12:31,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-11-22 18:12:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 618 transitions. [2024-11-22 18:12:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-22 18:12:31,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:12:31,400 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:12:31,412 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 (15)] Ended with exit code 0 [2024-11-22 18:12:31,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:31,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:12:31,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:12:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1038220470, now seen corresponding path program 1 times [2024-11-22 18:12:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:12:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729808629] [2024-11-22 18:12:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:12:31,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:12:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:12:31,603 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:12:31,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 18:12:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:12:32,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-22 18:12:32,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:12:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-22 18:12:34,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:12:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-22 18:12:39,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:12:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729808629] [2024-11-22 18:12:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729808629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:12:39,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:12:39,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-22 18:12:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599830417] [2024-11-22 18:12:39,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:12:39,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-22 18:12:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:12:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-22 18:12:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-22 18:12:39,495 INFO L87 Difference]: Start difference. First operand 499 states and 618 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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-11-22 18:13:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:13:06,096 INFO L93 Difference]: Finished difference Result 557 states and 729 transitions. [2024-11-22 18:13:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-22 18:13:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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 219 [2024-11-22 18:13:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:13:06,098 INFO L225 Difference]: With dead ends: 557 [2024-11-22 18:13:06,099 INFO L226 Difference]: Without dead ends: 557 [2024-11-22 18:13:06,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-11-22 18:13:06,105 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 106 mSDsluCounter, 10951 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 11172 SdHoareTripleChecker+Invalid, 5316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:13:06,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 11172 Invalid, 5316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-22 18:13:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-22 18:13:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2024-11-22 18:13:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 543 states have (on average 1.3186003683241252) internal successors, (716), 546 states have internal predecessors, (716), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:13:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 725 transitions. [2024-11-22 18:13:06,112 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 725 transitions. Word has length 219 [2024-11-22 18:13:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:13:06,112 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 725 transitions. [2024-11-22 18:13:06,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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-11-22 18:13:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 725 transitions. [2024-11-22 18:13:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-22 18:13:06,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:13:06,115 INFO L215 NwaCegarLoop]: trace histogram [142, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:13:06,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-22 18:13:06,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:13:06,315 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:13:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:13:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1417198230, now seen corresponding path program 2 times [2024-11-22 18:13:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:13:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773299568] [2024-11-22 18:13:06,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:13:06,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:13:06,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:13:06,319 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:13:06,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 18:13:08,237 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:13:08,238 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:13:08,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 2112 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-22 18:13:08,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:13:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10301 backedges. 4459 proven. 4851 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-22 18:13:13,693 INFO L311 TraceCheckSpWp]: Computing backward predicates...