./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:26:30,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:26:30,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:26:30,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:26:30,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:26:30,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:26:30,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:26:30,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:26:30,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:26:30,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:26:30,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:26:30,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:26:30,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:26:30,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:26:30,484 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:26:30,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:26:30,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:26:30,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:26:30,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:26:30,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:26:30,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:26:30,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:26:30,487 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:26:30,487 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:26:30,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:26:30,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:26:30,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:26:30,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:26:30,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:26:30,489 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:26:30,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:26:30,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:26:30,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:26:30,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:26:30,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:26:30,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:26:30,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:26:30,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:26:30,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:26:30,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:26:30,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:26:30,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:26:30,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:26:30,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:26:30,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:26:30,497 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 -> 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed [2024-11-19 06:26:30,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:26:30,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:26:30,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:26:30,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:26:30,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:26:30,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 06:26:32,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:26:32,385 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:26:32,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 06:26:32,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6fe8c88/37a11b3c39f149a08de81058992d8740/FLAGbb0e6dfc4 [2024-11-19 06:26:32,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6fe8c88/37a11b3c39f149a08de81058992d8740 [2024-11-19 06:26:32,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:26:32,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:26:32,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:32,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:26:32,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:26:32,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:32" (1/1) ... [2024-11-19 06:26:32,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60880729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:32, skipping insertion in model container [2024-11-19 06:26:32,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:32" (1/1) ... [2024-11-19 06:26:32,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:26:32,969 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,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-19 06:26:33,015 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,022 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,030 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,054 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,055 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,057 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,059 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,059 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,060 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,064 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:33,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:33,080 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:26:33,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4961d1ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:33, skipping insertion in model container [2024-11-19 06:26:33,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:33,082 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:26:33,084 INFO L158 Benchmark]: Toolchain (without parser) took 656.13ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 54.9MB in the beginning and 140.7MB in the end (delta: -85.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-19 06:26:33,085 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:26:33,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.60ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 54.9MB in the beginning and 140.7MB in the end (delta: -85.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-19 06:26:33,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.60ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 54.9MB in the beginning and 140.7MB in the end (delta: -85.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:26:35,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:26:35,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:26:35,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:26:35,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:26:35,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:26:35,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:26:35,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:26:35,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:26:35,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:26:35,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:26:35,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:26:35,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:26:35,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:26:35,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:26:35,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:26:35,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:26:35,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:26:35,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:26:35,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:26:35,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:26:35,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:26:35,252 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:26:35,252 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:26:35,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:26:35,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:26:35,253 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:26:35,253 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:26:35,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:26:35,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:26:35,254 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:26:35,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:26:35,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:26:35,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:26:35,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:26:35,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:26:35,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:26:35,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:26:35,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:26:35,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:26:35,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:26:35,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:26:35,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:26:35,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:26:35,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:26:35,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:26:35,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:26:35,259 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 -> 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed [2024-11-19 06:26:35,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:26:35,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:26:35,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:26:35,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:26:35,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:26:35,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 06:26:37,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:26:37,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:26:37,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 06:26:37,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d4b0e00/ca537dd3270a4b30b66eba1fbc9cbff0/FLAG30b216013 [2024-11-19 06:26:37,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d4b0e00/ca537dd3270a4b30b66eba1fbc9cbff0 [2024-11-19 06:26:37,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:26:37,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:26:37,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:37,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:26:37,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:26:37,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:37" (1/1) ... [2024-11-19 06:26:37,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a83874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:37, skipping insertion in model container [2024-11-19 06:26:37,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:37" (1/1) ... [2024-11-19 06:26:37,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:26:38,280 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,311 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,315 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,318 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,325 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,347 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,350 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,352 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,358 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,366 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:38,394 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:26:38,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:26:38,440 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,463 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,469 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,471 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,477 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,497 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,498 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,499 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,500 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,505 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,508 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:26:38,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:38,530 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:26:38,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:38,637 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:26:38,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38 WrapperNode [2024-11-19 06:26:38,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:38,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:26:38,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:26:38,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:26:38,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,742 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 792 [2024-11-19 06:26:38,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:26:38,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:26:38,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:26:38,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:26:38,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,853 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-19 06:26:38,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:26:38,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:26:38,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:26:38,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:26:38,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (1/1) ... [2024-11-19 06:26:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:26:38,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:26:38,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:26:38,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:26:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:26:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:26:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:26:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:26:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:26:39,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:26:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:26:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:26:39,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:26:39,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:26:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:26:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:26:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:26:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:26:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:26:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:26:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:26:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:26:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:26:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:26:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:26:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:26:39,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:26:39,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:26:39,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:26:47,240 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-19 06:26:47,241 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:26:47,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:26:47,262 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-19 06:26:47,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:47 BoogieIcfgContainer [2024-11-19 06:26:47,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:26:47,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:26:47,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:26:47,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:26:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:37" (1/3) ... [2024-11-19 06:26:47,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a380b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:47, skipping insertion in model container [2024-11-19 06:26:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:38" (2/3) ... [2024-11-19 06:26:47,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a380b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:47, skipping insertion in model container [2024-11-19 06:26:47,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:47" (3/3) ... [2024-11-19 06:26:47,273 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-2.i [2024-11-19 06:26:47,290 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:26:47,291 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:26:47,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:26:47,368 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;@3cd41c5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:26:47,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:26:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 146 states have (on average 1.6506849315068493) internal successors, (241), 158 states have internal predecessors, (241), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:26:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:26:47,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:47,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:47,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1985805395, now seen corresponding path program 1 times [2024-11-19 06:26:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642795969] [2024-11-19 06:26:47,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:47,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:47,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:47,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:26:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:47,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:26:47,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:26:47,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:47,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642795969] [2024-11-19 06:26:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642795969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:26:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253372405] [2024-11-19 06:26:47,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:47,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:26:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:47,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:26:47,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:26:47,601 INFO L87 Difference]: Start difference. First operand has 164 states, 146 states have (on average 1.6506849315068493) internal successors, (241), 158 states have internal predecessors, (241), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:47,628 INFO L93 Difference]: Finished difference Result 163 states and 220 transitions. [2024-11-19 06:26:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:26:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 06:26:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:47,638 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:26:47,638 INFO L226 Difference]: Without dead ends: 161 [2024-11-19 06:26:47,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-19 06:26:47,643 INFO L432 NwaCegarLoop]: 220 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, 220 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-19 06:26:47,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:26:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-19 06:26:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-19 06:26:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 155 states have internal predecessors, (192), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:26:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 218 transitions. [2024-11-19 06:26:47,692 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 218 transitions. Word has length 11 [2024-11-19 06:26:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:47,694 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 218 transitions. [2024-11-19 06:26:47,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 218 transitions. [2024-11-19 06:26:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:26:47,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:47,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:47,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:26:47,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:47,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:47,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1202377151, now seen corresponding path program 1 times [2024-11-19 06:26:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833007983] [2024-11-19 06:26:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:47,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:47,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:47,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:47,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:26:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:48,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:26:48,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:48,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-19 06:26:48,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:48,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:48,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833007983] [2024-11-19 06:26:48,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833007983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:48,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:48,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:26:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279443918] [2024-11-19 06:26:48,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:48,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:26:48,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:48,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:26:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:26:48,069 INFO L87 Difference]: Start difference. First operand 161 states and 218 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:48,247 INFO L93 Difference]: Finished difference Result 250 states and 333 transitions. [2024-11-19 06:26:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:26:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 06:26:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:48,256 INFO L225 Difference]: With dead ends: 250 [2024-11-19 06:26:48,256 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 06:26:48,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:26:48,258 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 108 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:48,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 455 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:26:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 06:26:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 162. [2024-11-19 06:26:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 156 states have internal predecessors, (193), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:26:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2024-11-19 06:26:48,275 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 11 [2024-11-19 06:26:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2024-11-19 06:26:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2024-11-19 06:26:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:26:48,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:48,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:48,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:26:48,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:48,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:48,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -271408190, now seen corresponding path program 1 times [2024-11-19 06:26:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:48,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74554290] [2024-11-19 06:26:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:48,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:48,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:48,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:26:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:48,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:26:48,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:26:48,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:48,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:48,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74554290] [2024-11-19 06:26:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74554290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:48,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:26:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540115522] [2024-11-19 06:26:48,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:48,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:26:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:26:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:26:48,903 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:49,058 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2024-11-19 06:26:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:26:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-19 06:26:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:49,061 INFO L225 Difference]: With dead ends: 165 [2024-11-19 06:26:49,061 INFO L226 Difference]: Without dead ends: 165 [2024-11-19 06:26:49,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-19 06:26:49,062 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 30 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 545 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-19 06:26:49,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 545 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:26:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-19 06:26:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-19 06:26:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 148 states have (on average 1.2702702702702702) internal successors, (188), 159 states have internal predecessors, (188), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:26:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2024-11-19 06:26:49,084 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 66 [2024-11-19 06:26:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:49,084 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2024-11-19 06:26:49,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2024-11-19 06:26:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:26:49,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:49,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:49,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:26:49,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:49,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -293294794, now seen corresponding path program 1 times [2024-11-19 06:26:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904130809] [2024-11-19 06:26:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:49,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:49,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:49,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:26:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:49,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:26:49,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:26:49,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:49,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904130809] [2024-11-19 06:26:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904130809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:49,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:26:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194422365] [2024-11-19 06:26:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:26:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:26:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:26:49,760 INFO L87 Difference]: Start difference. First operand 165 states and 214 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:49,873 INFO L93 Difference]: Finished difference Result 159 states and 204 transitions. [2024-11-19 06:26:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:26:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-19 06:26:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:49,875 INFO L225 Difference]: With dead ends: 159 [2024-11-19 06:26:49,875 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 06:26:49,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:26:49,877 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:49,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:26:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 06:26:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-19 06:26:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 142 states have (on average 1.2535211267605635) internal successors, (178), 153 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:26:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2024-11-19 06:26:49,885 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 66 [2024-11-19 06:26:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:49,886 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2024-11-19 06:26:49,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2024-11-19 06:26:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:26:49,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:49,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:49,898 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-19 06:26:50,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:50,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:50,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:50,090 INFO L85 PathProgramCache]: Analyzing trace with hash 101071992, now seen corresponding path program 1 times [2024-11-19 06:26:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140814492] [2024-11-19 06:26:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:50,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:50,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:50,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:50,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:26:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:50,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:26:50,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:26:50,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:50,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:50,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140814492] [2024-11-19 06:26:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140814492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:50,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:26:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545779690] [2024-11-19 06:26:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:50,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:26:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:26:50,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:26:50,740 INFO L87 Difference]: Start difference. First operand 159 states and 204 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:51,155 INFO L93 Difference]: Finished difference Result 226 states and 280 transitions. [2024-11-19 06:26:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:26:51,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-19 06:26:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:51,164 INFO L225 Difference]: With dead ends: 226 [2024-11-19 06:26:51,165 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 06:26:51,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-19 06:26:51,166 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 38 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:51,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 409 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:26:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 06:26:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 195. [2024-11-19 06:26:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.202247191011236) internal successors, (214), 189 states have internal predecessors, (214), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:26:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 240 transitions. [2024-11-19 06:26:51,175 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 240 transitions. Word has length 66 [2024-11-19 06:26:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:51,179 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 240 transitions. [2024-11-19 06:26:51,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 240 transitions. [2024-11-19 06:26:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 06:26:51,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:51,185 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:51,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:26:51,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:51,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:51,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1002634397, now seen corresponding path program 1 times [2024-11-19 06:26:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890384887] [2024-11-19 06:26:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:51,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:51,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:26:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:51,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:26:51,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:26:51,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:51,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890384887] [2024-11-19 06:26:51,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890384887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:51,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:51,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:26:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932460528] [2024-11-19 06:26:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:51,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:26:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:51,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:26:51,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:26:51,827 INFO L87 Difference]: Start difference. First operand 195 states and 240 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:26:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:51,860 INFO L93 Difference]: Finished difference Result 198 states and 244 transitions. [2024-11-19 06:26:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:26:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2024-11-19 06:26:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:51,863 INFO L225 Difference]: With dead ends: 198 [2024-11-19 06:26:51,863 INFO L226 Difference]: Without dead ends: 198 [2024-11-19 06:26:51,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:26:51,864 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 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-19 06:26:51,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:26:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-19 06:26:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-19 06:26:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 180 states have (on average 1.2055555555555555) internal successors, (217), 192 states have internal predecessors, (217), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 06:26:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2024-11-19 06:26:51,871 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 81 [2024-11-19 06:26:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:51,871 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2024-11-19 06:26:51,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:26:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2024-11-19 06:26:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 06:26:51,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:51,873 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, 1] [2024-11-19 06:26:51,884 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-19 06:26:52,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:52,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 305496187, now seen corresponding path program 1 times [2024-11-19 06:26:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045467852] [2024-11-19 06:26:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:52,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:52,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:26:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:52,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:26:52,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:26:52,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:26:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:26:52,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045467852] [2024-11-19 06:26:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045467852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:26:52,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:26:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:26:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030505024] [2024-11-19 06:26:52,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:26:52,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:26:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:26:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:26:52,661 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-19 06:26:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:52,813 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2024-11-19 06:26:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:26:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 83 [2024-11-19 06:26:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:52,816 INFO L225 Difference]: With dead ends: 209 [2024-11-19 06:26:52,817 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 06:26:52,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 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-19 06:26:52,818 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:52,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1184 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:26:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 06:26:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-19 06:26:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 200 states have internal predecessors, (231), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 06:26:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2024-11-19 06:26:52,834 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 83 [2024-11-19 06:26:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:52,834 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2024-11-19 06:26:52,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-19 06:26:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2024-11-19 06:26:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 06:26:52,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:52,835 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:52,847 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-19 06:26:53,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:53,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash 57526749, now seen corresponding path program 2 times [2024-11-19 06:26:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249003216] [2024-11-19 06:26:53,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:26:53,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:53,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:53,039 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:53,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:26:53,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:26:53,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:26:53,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:26:53,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:26:53,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:26:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:26:53,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249003216] [2024-11-19 06:26:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249003216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:26:53,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:26:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:26:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804895434] [2024-11-19 06:26:53,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:26:53,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:26:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:26:53,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:26:53,890 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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-19 06:26:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:54,452 INFO L93 Difference]: Finished difference Result 222 states and 280 transitions. [2024-11-19 06:26:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:26:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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 87 [2024-11-19 06:26:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:54,454 INFO L225 Difference]: With dead ends: 222 [2024-11-19 06:26:54,454 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 06:26:54,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:26:54,455 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:54,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1194 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:26:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 06:26:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-19 06:26:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 197 states have (on average 1.233502538071066) internal successors, (243), 209 states have internal predecessors, (243), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 06:26:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 270 transitions. [2024-11-19 06:26:54,462 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 270 transitions. Word has length 87 [2024-11-19 06:26:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:54,463 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 270 transitions. [2024-11-19 06:26:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 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-19 06:26:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 270 transitions. [2024-11-19 06:26:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 06:26:54,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:54,465 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:54,477 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-19 06:26:54,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:54,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash -326764801, now seen corresponding path program 3 times [2024-11-19 06:26:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291221255] [2024-11-19 06:26:54,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:26:54,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:54,669 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:54,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:26:55,012 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:26:55,012 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:26:55,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:26:55,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 06:26:55,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:26:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 06:26:55,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:55,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291221255] [2024-11-19 06:26:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291221255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:26:55,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:26:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 06:26:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195168066] [2024-11-19 06:26:55,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:26:55,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:26:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:26:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:26:55,328 INFO L87 Difference]: Start difference. First operand 216 states and 270 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:26:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:55,649 INFO L93 Difference]: Finished difference Result 436 states and 534 transitions. [2024-11-19 06:26:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:26:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-11-19 06:26:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:55,653 INFO L225 Difference]: With dead ends: 436 [2024-11-19 06:26:55,653 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 06:26:55,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:26:55,654 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 411 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 865 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:55,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 865 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:26:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 06:26:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2024-11-19 06:26:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 408 states have (on average 1.1911764705882353) internal successors, (486), 420 states have internal predecessors, (486), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-19 06:26:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 534 transitions. [2024-11-19 06:26:55,675 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 534 transitions. Word has length 96 [2024-11-19 06:26:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:55,676 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 534 transitions. [2024-11-19 06:26:55,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:26:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 534 transitions. [2024-11-19 06:26:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-19 06:26:55,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:55,683 INFO L215 NwaCegarLoop]: trace histogram [15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-19 06:26:55,695 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-19 06:26:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:55,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:55,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash 811540570, now seen corresponding path program 1 times [2024-11-19 06:26:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:55,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756111112] [2024-11-19 06:26:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:55,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:55,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:55,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:55,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:26:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:56,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:26:56,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 181 proven. 55 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 06:26:57,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:26:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 112 proven. 123 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-19 06:26:57,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756111112] [2024-11-19 06:26:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756111112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:26:57,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:26:57,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:26:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413286582] [2024-11-19 06:26:57,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:26:57,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:26:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:26:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:26:57,762 INFO L87 Difference]: Start difference. First operand 436 states and 534 transitions. Second operand has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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-19 06:26:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:59,457 INFO L93 Difference]: Finished difference Result 460 states and 577 transitions. [2024-11-19 06:26:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:26:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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 261 [2024-11-19 06:26:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:59,462 INFO L225 Difference]: With dead ends: 460 [2024-11-19 06:26:59,462 INFO L226 Difference]: Without dead ends: 456 [2024-11-19 06:26:59,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:26:59,464 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 14 mSDsluCounter, 2961 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3161 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:59,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3161 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:26:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-19 06:26:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2024-11-19 06:26:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 426 states have (on average 1.1971830985915493) internal successors, (510), 438 states have internal predecessors, (510), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-19 06:26:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 558 transitions. [2024-11-19 06:26:59,496 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 558 transitions. Word has length 261 [2024-11-19 06:26:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:59,500 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 558 transitions. [2024-11-19 06:26:59,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 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-19 06:26:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 558 transitions. [2024-11-19 06:26:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-19 06:26:59,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:59,508 INFO L215 NwaCegarLoop]: trace histogram [33, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-19 06:26:59,540 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-19 06:26:59,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:59,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 868288538, now seen corresponding path program 2 times [2024-11-19 06:26:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:59,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140166272] [2024-11-19 06:26:59,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:26:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:26:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:59,712 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:26:59,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:27:00,758 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:27:00,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:27:00,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:27:00,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 391 proven. 253 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-19 06:27:01,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:27:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 112 proven. 531 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-19 06:27:03,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:03,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140166272] [2024-11-19 06:27:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140166272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:27:03,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:27:03,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:27:03,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710500682] [2024-11-19 06:27:03,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:27:03,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:27:03,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:03,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:27:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:27:03,392 INFO L87 Difference]: Start difference. First operand 454 states and 558 transitions. Second operand has 50 states, 50 states have (on average 3.34) internal successors, (167), 50 states have internal predecessors, (167), 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-19 06:27:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:11,324 INFO L93 Difference]: Finished difference Result 494 states and 633 transitions. [2024-11-19 06:27:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:27:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.34) internal successors, (167), 50 states have internal predecessors, (167), 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 279 [2024-11-19 06:27:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:11,332 INFO L225 Difference]: With dead ends: 494 [2024-11-19 06:27:11,332 INFO L226 Difference]: Without dead ends: 490 [2024-11-19 06:27:11,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:27:11,336 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 26 mSDsluCounter, 4558 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4758 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:11,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4758 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 06:27:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-19 06:27:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 488. [2024-11-19 06:27:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 460 states have (on average 1.208695652173913) internal successors, (556), 472 states have internal predecessors, (556), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-19 06:27:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 604 transitions. [2024-11-19 06:27:11,351 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 604 transitions. Word has length 279 [2024-11-19 06:27:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:11,351 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 604 transitions. [2024-11-19 06:27:11,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.34) internal successors, (167), 50 states have internal predecessors, (167), 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-19 06:27:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 604 transitions. [2024-11-19 06:27:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-19 06:27:11,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:11,356 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-19 06:27:11,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:27:11,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:27:11,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1188849434, now seen corresponding path program 3 times [2024-11-19 06:27:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:11,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316996884] [2024-11-19 06:27:11,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:27:11,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:27:11,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:11,560 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:27:11,561 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