./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f 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_SAX_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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:55:02,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:55:02,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:55:02,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:55:02,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:55:02,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:55:02,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:55:02,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:55:02,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:55:02,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:55:02,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:55:02,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:55:02,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:55:02,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:55:02,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:55:02,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:55:02,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:55:02,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:55:02,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:55:02,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:55:02,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:55:02,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:55:02,446 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:55:02,446 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:55:02,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:55:02,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:55:02,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:55:02,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:55:02,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:55:02,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:55:02,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:55:02,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:55:02,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:55:02,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:55:02,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:55:02,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:55:02,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:55:02,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:55:02,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:55:02,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:55:02,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:55:02,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:55:02,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:55:02,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:55:02,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:55:02,456 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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2024-11-10 14:55:02,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:55:02,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:55:02,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:55:02,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:55:02,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:55:02,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-11-10 14:55:04,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:55:04,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:55:04,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-11-10 14:55:04,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eade79b/c367029bb9f24f32b5c3825b32ce05c5/FLAGb7e2ce6a1 [2024-11-10 14:55:04,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eade79b/c367029bb9f24f32b5c3825b32ce05c5 [2024-11-10 14:55:04,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:55:04,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:55:04,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:55:04,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:55:04,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:55:04,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:04" (1/1) ... [2024-11-10 14:55:04,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af63703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:04, skipping insertion in model container [2024-11-10 14:55:04,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:04" (1/1) ... [2024-11-10 14:55:04,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:55:05,101 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,146 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,149 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,152 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,156 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,170 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,184 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,185 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,186 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,191 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,198 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:05,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:55:05,227 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-10 14:55:05,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57ab9c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:05, skipping insertion in model container [2024-11-10 14:55:05,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:55:05,229 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 14:55:05,231 INFO L158 Benchmark]: Toolchain (without parser) took 643.56ms. Allocated memory is still 144.7MB. Free memory was 115.1MB in the beginning and 106.4MB in the end (delta: 8.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 14:55:05,231 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:55:05,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.65ms. Allocated memory is still 144.7MB. Free memory was 114.4MB in the beginning and 106.4MB in the end (delta: 8.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 14:55:05,234 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.23ms. Allocated memory is still 96.5MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.65ms. Allocated memory is still 144.7MB. Free memory was 114.4MB in the beginning and 106.4MB in the end (delta: 8.1MB). Peak memory consumption was 12.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_SAX_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 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:55:07,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:55:07,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-10 14:55:07,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:55:07,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:55:07,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:55:07,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:55:07,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:55:07,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:55:07,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:55:07,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:55:07,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:55:07,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:55:07,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:55:07,405 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:55:07,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:55:07,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:55:07,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:55:07,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:55:07,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:55:07,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:55:07,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:55:07,408 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:55:07,408 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:55:07,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:55:07,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:55:07,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:55:07,409 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:55:07,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:55:07,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:55:07,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:55:07,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:55:07,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:55:07,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:55:07,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:55:07,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:55:07,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:55:07,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:55:07,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:55:07,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:55:07,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:55:07,414 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:55:07,414 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:55:07,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:55:07,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:55:07,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:55:07,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:55:07,415 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 -> 7f552e336cb6eb3ea16ba25a84411e1d0c8dcfaa2b088c21df87ffefed1a84a7 [2024-11-10 14:55:07,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:55:07,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:55:07,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:55:07,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:55:07,760 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:55:07,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-11-10 14:55:09,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:55:09,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:55:09,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-2.i [2024-11-10 14:55:09,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c917661/908e74405a0346c18be4bc3e483d0075/FLAG388414878 [2024-11-10 14:55:09,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c917661/908e74405a0346c18be4bc3e483d0075 [2024-11-10 14:55:09,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:55:09,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:55:09,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:55:09,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:55:09,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:55:09,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:09" (1/1) ... [2024-11-10 14:55:09,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247a14c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:09, skipping insertion in model container [2024-11-10 14:55:09,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:55:09" (1/1) ... [2024-11-10 14:55:09,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:55:10,339 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,380 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,386 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,389 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,395 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,406 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,408 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,411 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,413 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,414 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,417 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,425 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:55:10,452 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 14:55:10,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:55:10,511 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,539 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,541 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,548 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,558 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,571 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,572 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,574 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,575 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,576 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,576 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,584 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:55:10,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:55:10,598 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:55:10,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:55:10,741 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:55:10,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10 WrapperNode [2024-11-10 14:55:10,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:55:10,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:55:10,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:55:10,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:55:10,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:10,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:10,867 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 769 [2024-11-10 14:55:10,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:55:10,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:55:10,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:55:10,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:55:10,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:10,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:10,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:10,970 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-10 14:55:10,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:10,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:11,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:11,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:11,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:11,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:11,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:55:11,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:55:11,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:55:11,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:55:11,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (1/1) ... [2024-11-10 14:55:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:55:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:55:11,086 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-10 14:55:11,094 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-10 14:55:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 14:55:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 14:55:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 14:55:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 14:55:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 14:55:11,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 14:55:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 14:55:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 14:55:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 14:55:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 14:55:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:55:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:55:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:55:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:55:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:55:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:55:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:55:11,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 14:55:11,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 14:55:11,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 14:55:11,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 14:55:11,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:55:11,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:55:11,368 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:55:11,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:55:18,668 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-10 14:55:18,669 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:55:18,687 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:55:18,687 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:55:18,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:55:18 BoogieIcfgContainer [2024-11-10 14:55:18,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:55:18,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:55:18,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:55:18,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:55:18,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:55:09" (1/3) ... [2024-11-10 14:55:18,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc62fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:55:18, skipping insertion in model container [2024-11-10 14:55:18,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:55:10" (2/3) ... [2024-11-10 14:55:18,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc62fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:55:18, skipping insertion in model container [2024-11-10 14:55:18,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:55:18" (3/3) ... [2024-11-10 14:55:18,700 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-2.i [2024-11-10 14:55:18,717 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:55:18,718 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:55:18,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:55:18,774 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;@7dd495a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:55:18,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:55:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 151 states have (on average 1.6291390728476822) internal successors, (246), 163 states have internal predecessors, (246), 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-10 14:55:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:55:18,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:18,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:18,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:18,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1402945885, now seen corresponding path program 1 times [2024-11-10 14:55:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322634417] [2024-11-10 14:55:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:18,809 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-10 14:55:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:18,811 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-10 14:55:18,812 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-10 14:55:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:18,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 14:55:18,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:18,979 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-10 14:55:18,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:55:18,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322634417] [2024-11-10 14:55:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322634417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:55:18,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:55:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:55:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536951730] [2024-11-10 14:55:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:55:18,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:55:18,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:55:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:55:19,023 INFO L87 Difference]: Start difference. First operand has 169 states, 151 states have (on average 1.6291390728476822) internal successors, (246), 163 states have internal predecessors, (246), 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.5) internal successors, (11), 2 states have internal predecessors, (11), 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-10 14:55:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:19,060 INFO L93 Difference]: Finished difference Result 168 states and 225 transitions. [2024-11-10 14:55:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:55:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 12 [2024-11-10 14:55:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:19,074 INFO L225 Difference]: With dead ends: 168 [2024-11-10 14:55:19,075 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 14:55:19,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-10 14:55:19,082 INFO L432 NwaCegarLoop]: 225 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, 225 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-10 14:55:19,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:55:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 14:55:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-10 14:55:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 159 states have internal predecessors, (196), 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-10 14:55:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2024-11-10 14:55:19,176 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 12 [2024-11-10 14:55:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:19,181 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2024-11-10 14:55:19,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-10 14:55:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2024-11-10 14:55:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 14:55:19,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:19,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:19,192 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-10 14:55:19,386 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-10 14:55:19,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:19,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1140123897, now seen corresponding path program 1 times [2024-11-10 14:55:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43789835] [2024-11-10 14:55:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:19,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-10 14:55:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:19,391 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-10 14:55:19,392 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-10 14:55:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:19,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:55:19,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:19,538 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-10 14:55:19,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:55:19,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43789835] [2024-11-10 14:55:19,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43789835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:55:19,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:55:19,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:55:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727776638] [2024-11-10 14:55:19,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:55:19,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:55:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:55:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:55:19,542 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10 14:55:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:19,711 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2024-11-10 14:55:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:55:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-10 14:55:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:19,720 INFO L225 Difference]: With dead ends: 257 [2024-11-10 14:55:19,720 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 14:55:19,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-10 14:55:19,721 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 110 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 436 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:19,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 436 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:55:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 14:55:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 167. [2024-11-10 14:55:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 150 states have (on average 1.32) internal successors, (198), 161 states have internal predecessors, (198), 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-10 14:55:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-11-10 14:55:19,748 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 13 [2024-11-10 14:55:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:19,748 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-11-10 14:55:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10 14:55:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-11-10 14:55:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 14:55:19,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:19,754 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:19,760 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-10 14:55:19,954 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-10 14:55:19,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1603320315, now seen corresponding path program 1 times [2024-11-10 14:55:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:19,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060436982] [2024-11-10 14:55:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:19,957 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-10 14:55:19,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:19,959 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-10 14:55:19,960 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-10 14:55:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:20,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:55:20,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:55:20,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:55:20,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060436982] [2024-11-10 14:55:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060436982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:55:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:55:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:55:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652104410] [2024-11-10 14:55:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:55:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:55:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:55:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:55:20,487 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-10 14:55:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:20,635 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2024-11-10 14:55:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:55:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 70 [2024-11-10 14:55:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:20,640 INFO L225 Difference]: With dead ends: 170 [2024-11-10 14:55:20,640 INFO L226 Difference]: Without dead ends: 170 [2024-11-10 14:55:20,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-10 14:55:20,642 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 30 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 556 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-10 14:55:20,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 556 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:55:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-10 14:55:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-10 14:55:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.261437908496732) internal successors, (193), 164 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-10 14:55:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2024-11-10 14:55:20,660 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 70 [2024-11-10 14:55:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:20,660 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2024-11-10 14:55:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-10 14:55:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2024-11-10 14:55:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 14:55:20,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:20,666 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:20,678 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-10 14:55:20,866 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-10 14:55:20,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:20,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 7902197, now seen corresponding path program 1 times [2024-11-10 14:55:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:20,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802832621] [2024-11-10 14:55:20,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:20,869 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-10 14:55:20,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:20,872 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-10 14:55:20,875 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-10 14:55:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:21,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:55:21,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:55:21,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:55:21,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802832621] [2024-11-10 14:55:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802832621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:55:21,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:55:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:55:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498542593] [2024-11-10 14:55:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:55:21,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:55:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:55:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:55:21,535 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10 14:55:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:22,129 INFO L93 Difference]: Finished difference Result 245 states and 307 transitions. [2024-11-10 14:55:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:55:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 70 [2024-11-10 14:55:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:22,136 INFO L225 Difference]: With dead ends: 245 [2024-11-10 14:55:22,136 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 14:55:22,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-10 14:55:22,137 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 43 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 427 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.6s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:22,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 427 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 14:55:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 14:55:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2024-11-10 14:55:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 196 states have (on average 1.2244897959183674) internal successors, (240), 207 states have internal predecessors, (240), 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-10 14:55:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 266 transitions. [2024-11-10 14:55:22,148 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 266 transitions. Word has length 70 [2024-11-10 14:55:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:22,149 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 266 transitions. [2024-11-10 14:55:22,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-10 14:55:22,149 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 266 transitions. [2024-11-10 14:55:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 14:55:22,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:22,152 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, 1, 1] [2024-11-10 14:55:22,162 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-10 14:55:22,352 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-10 14:55:22,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:22,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash 958572766, now seen corresponding path program 1 times [2024-11-10 14:55:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:22,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440936315] [2024-11-10 14:55:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:22,355 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-10 14:55:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:22,358 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-10 14:55:22,359 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-10 14:55:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:22,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:55:22,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:55:22,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:55:22,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440936315] [2024-11-10 14:55:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440936315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:55:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:55:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:55:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077213412] [2024-11-10 14:55:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:55:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:55:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:55:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:55:22,846 INFO L87 Difference]: Start difference. First operand 213 states and 266 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-10 14:55:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:22,894 INFO L93 Difference]: Finished difference Result 216 states and 270 transitions. [2024-11-10 14:55:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:55:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 85 [2024-11-10 14:55:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:22,897 INFO L225 Difference]: With dead ends: 216 [2024-11-10 14:55:22,897 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 14:55:22,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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-10 14:55:22,898 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 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-10 14:55:22,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:55:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 14:55:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-10 14:55:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 198 states have (on average 1.2272727272727273) internal successors, (243), 210 states have internal predecessors, (243), 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-10 14:55:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 270 transitions. [2024-11-10 14:55:22,908 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 270 transitions. Word has length 85 [2024-11-10 14:55:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:22,908 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 270 transitions. [2024-11-10 14:55:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-10 14:55:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 270 transitions. [2024-11-10 14:55:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 14:55:22,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:22,911 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:22,922 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-10 14:55:23,111 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-10 14:55:23,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash -156424350, now seen corresponding path program 1 times [2024-11-10 14:55:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837695918] [2024-11-10 14:55:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:23,114 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-10 14:55:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:23,117 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-10 14:55:23,121 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-10 14:55:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:23,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:55:23,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:55:23,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:55:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:55:23,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:23,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837695918] [2024-11-10 14:55:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837695918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:55:23,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:55:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 14:55:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436446023] [2024-11-10 14:55:23,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:55:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:55:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:23,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:55:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:55:23,680 INFO L87 Difference]: Start difference. First operand 216 states and 270 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-10 14:55:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:23,862 INFO L93 Difference]: Finished difference Result 227 states and 286 transitions. [2024-11-10 14:55:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:55:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-10 14:55:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:23,864 INFO L225 Difference]: With dead ends: 227 [2024-11-10 14:55:23,864 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 14:55:23,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 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-10 14:55:23,865 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 5 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:23,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 623 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:55:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 14:55:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2024-11-10 14:55:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 218 states have internal predecessors, (257), 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-10 14:55:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 284 transitions. [2024-11-10 14:55:23,873 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 284 transitions. Word has length 87 [2024-11-10 14:55:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:23,874 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 284 transitions. [2024-11-10 14:55:23,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-10 14:55:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2024-11-10 14:55:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 14:55:23,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:23,876 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:23,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 14:55:24,076 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-10 14:55:24,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:24,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:24,077 INFO L85 PathProgramCache]: Analyzing trace with hash -574514978, now seen corresponding path program 2 times [2024-11-10 14:55:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578189714] [2024-11-10 14:55:24,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:55:24,078 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-10 14:55:24,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:24,081 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-10 14:55:24,082 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-10 14:55:24,531 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:55:24,531 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:55:24,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 14:55:24,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:55:24,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:55:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:55:24,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578189714] [2024-11-10 14:55:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578189714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:55:24,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:55:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 14:55:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298969488] [2024-11-10 14:55:24,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:55:24,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 14:55:24,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:24,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 14:55:24,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:55:24,940 INFO L87 Difference]: Start difference. First operand 225 states and 284 transitions. Second operand has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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-10 14:55:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:25,590 INFO L93 Difference]: Finished difference Result 240 states and 306 transitions. [2024-11-10 14:55:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 14:55:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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 91 [2024-11-10 14:55:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:25,594 INFO L225 Difference]: With dead ends: 240 [2024-11-10 14:55:25,594 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 14:55:25,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:55:25,595 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:25,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1241 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 14:55:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 14:55:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-11-10 14:55:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 227 states have internal predecessors, (269), 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-10 14:55:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 296 transitions. [2024-11-10 14:55:25,608 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 296 transitions. Word has length 91 [2024-11-10 14:55:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:25,608 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 296 transitions. [2024-11-10 14:55:25,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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-10 14:55:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 296 transitions. [2024-11-10 14:55:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 14:55:25,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:25,610 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:55:25,625 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-10 14:55:25,814 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-10 14:55:25,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:25,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -125443274, now seen corresponding path program 3 times [2024-11-10 14:55:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254562295] [2024-11-10 14:55:25,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:55:25,816 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-10 14:55:25,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:25,817 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-10 14:55:25,819 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-10 14:55:26,223 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:55:26,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:55:26,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:55:26,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-10 14:55:26,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:55:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-10 14:55:26,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254562295] [2024-11-10 14:55:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254562295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:55:26,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:55:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 14:55:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816096727] [2024-11-10 14:55:26,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:55:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:55:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:55:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:55:26,775 INFO L87 Difference]: Start difference. First operand 234 states and 296 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10 14:55:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:27,191 INFO L93 Difference]: Finished difference Result 474 states and 588 transitions. [2024-11-10 14:55:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:55:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 100 [2024-11-10 14:55:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:27,196 INFO L225 Difference]: With dead ends: 474 [2024-11-10 14:55:27,196 INFO L226 Difference]: Without dead ends: 474 [2024-11-10 14:55:27,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 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-10 14:55:27,197 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 448 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:27,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 852 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 14:55:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-10 14:55:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-11-10 14:55:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 446 states have (on average 1.210762331838565) internal successors, (540), 458 states have internal predecessors, (540), 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-10 14:55:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 588 transitions. [2024-11-10 14:55:27,222 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 588 transitions. Word has length 100 [2024-11-10 14:55:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:27,223 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 588 transitions. [2024-11-10 14:55:27,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-10 14:55:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 588 transitions. [2024-11-10 14:55:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-10 14:55:27,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:27,229 INFO L215 NwaCegarLoop]: trace histogram [15, 5, 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, 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, 1] [2024-11-10 14:55:27,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 14:55:27,430 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-10 14:55:27,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:27,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1795110746, now seen corresponding path program 1 times [2024-11-10 14:55:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:27,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182658449] [2024-11-10 14:55:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:55:27,432 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-10 14:55:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:27,433 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-10 14:55:27,434 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-10 14:55:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:55:28,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 14:55:28,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 188 proven. 55 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-10 14:55:28,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:55:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 119 proven. 123 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-10 14:55:29,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182658449] [2024-11-10 14:55:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182658449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:55:29,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:55:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 14:55:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780772259] [2024-11-10 14:55:29,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:55:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 14:55:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 14:55:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:55:29,268 INFO L87 Difference]: Start difference. First operand 474 states and 588 transitions. Second operand has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 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-10 14:55:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:31,089 INFO L93 Difference]: Finished difference Result 498 states and 631 transitions. [2024-11-10 14:55:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 14:55:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 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 271 [2024-11-10 14:55:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:31,093 INFO L225 Difference]: With dead ends: 498 [2024-11-10 14:55:31,093 INFO L226 Difference]: Without dead ends: 494 [2024-11-10 14:55:31,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 14:55:31,097 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 13 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:31,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2477 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 14:55:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-10 14:55:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2024-11-10 14:55:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 464 states have (on average 1.2155172413793103) internal successors, (564), 476 states have internal predecessors, (564), 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-10 14:55:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 612 transitions. [2024-11-10 14:55:31,115 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 612 transitions. Word has length 271 [2024-11-10 14:55:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:31,116 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 612 transitions. [2024-11-10 14:55:31,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 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-10 14:55:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 612 transitions. [2024-11-10 14:55:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-10 14:55:31,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:31,120 INFO L215 NwaCegarLoop]: trace histogram [33, 5, 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, 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, 1] [2024-11-10 14:55:31,151 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-10 14:55:31,322 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-10 14:55:31,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 590756006, now seen corresponding path program 2 times [2024-11-10 14:55:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:31,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550759253] [2024-11-10 14:55:31,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:55:31,324 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-10 14:55:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:31,325 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-10 14:55:31,327 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-10 14:55:32,419 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:55:32,420 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:55:32,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 14:55:32,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:55:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 398 proven. 253 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-10 14:55:32,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:55:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 119 proven. 531 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-10 14:55:34,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:55:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550759253] [2024-11-10 14:55:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550759253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:55:34,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:55:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 14:55:34,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739164805] [2024-11-10 14:55:34,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:55:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 14:55:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:55:34,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 14:55:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 14:55:34,580 INFO L87 Difference]: Start difference. First operand 492 states and 612 transitions. Second operand has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 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-10 14:55:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:55:40,737 INFO L93 Difference]: Finished difference Result 532 states and 687 transitions. [2024-11-10 14:55:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 14:55:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 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 289 [2024-11-10 14:55:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:55:40,741 INFO L225 Difference]: With dead ends: 532 [2024-11-10 14:55:40,741 INFO L226 Difference]: Without dead ends: 528 [2024-11-10 14:55:40,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 14:55:40,746 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 26 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 14:55:40,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5356 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 14:55:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-10 14:55:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 526. [2024-11-10 14:55:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 498 states have (on average 1.2248995983935742) internal successors, (610), 510 states have internal predecessors, (610), 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-10 14:55:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 658 transitions. [2024-11-10 14:55:40,761 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 658 transitions. Word has length 289 [2024-11-10 14:55:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:55:40,762 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 658 transitions. [2024-11-10 14:55:40,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 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-10 14:55:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 658 transitions. [2024-11-10 14:55:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-10 14:55:40,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:55:40,767 INFO L215 NwaCegarLoop]: trace histogram [67, 5, 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, 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, 1] [2024-11-10 14:55:40,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 14:55:40,967 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-10 14:55:40,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:55:40,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:55:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1645616678, now seen corresponding path program 3 times [2024-11-10 14:55:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:55:40,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124168085] [2024-11-10 14:55:40,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:55:40,970 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-10 14:55:40,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:55:40,971 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-10 14:55:40,972 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