./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:52:44,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:52:44,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:52:44,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:52:44,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:52:44,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:52:44,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:52:44,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:52:44,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:52:44,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:52:44,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:52:44,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:52:44,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:52:45,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:52:45,000 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:52:45,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:52:45,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:52:45,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:52:45,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:52:45,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:52:45,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:52:45,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:52:45,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:52:45,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:52:45,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:52:45,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:52:45,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:52:45,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:52:45,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:52:45,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:52:45,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:52:45,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:52:45,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:52:45,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:52:45,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:52:45,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:52:45,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:52:45,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:52:45,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:52:45,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:52:45,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:52:45,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:52:45,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:52:45,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:52:45,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:52:45,018 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-10-24 15:52:45,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:52:45,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:52:45,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:52:45,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:52:45,315 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:52:45,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2024-10-24 15:52:46,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:52:47,037 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:52:47,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2024-10-24 15:52:47,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d699f361/19fec0da445b4e809331cbb2abc0e1ed/FLAG99331c4bd [2024-10-24 15:52:47,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d699f361/19fec0da445b4e809331cbb2abc0e1ed [2024-10-24 15:52:47,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:52:47,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:52:47,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:47,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:52:47,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:52:47,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:47" (1/1) ... [2024-10-24 15:52:47,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c024e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:47, skipping insertion in model container [2024-10-24 15:52:47,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:47" (1/1) ... [2024-10-24 15:52:47,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:52:47,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:47,882 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 15:52:47,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12a79836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:47, skipping insertion in model container [2024-10-24 15:52:47,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:47,884 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:52:47,886 INFO L158 Benchmark]: Toolchain (without parser) took 557.81ms. Allocated memory is still 130.0MB. Free memory was 74.5MB in the beginning and 55.3MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:52:47,886 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 130.0MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:52:47,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.82ms. Allocated memory is still 130.0MB. Free memory was 74.2MB in the beginning and 55.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 15:52:47,888 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.22ms. Allocated memory is still 130.0MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.82ms. Allocated memory is still 130.0MB. Free memory was 74.2MB in the beginning and 55.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:52:49,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:52:50,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:52:50,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:52:50,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:52:50,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:52:50,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:52:50,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:52:50,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:52:50,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:52:50,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:52:50,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:52:50,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:52:50,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:52:50,103 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:52:50,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:52:50,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:52:50,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:52:50,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:52:50,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:52:50,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:52:50,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:52:50,109 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:52:50,109 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:52:50,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:52:50,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:52:50,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:52:50,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:52:50,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:52:50,111 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:52:50,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:52:50,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:52:50,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:52:50,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:52:50,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:52:50,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:52:50,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:52:50,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:52:50,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:52:50,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:52:50,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:52:50,115 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:52:50,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:52:50,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:52:50,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:52:50,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:52:50,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:52:50,116 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:52:50,116 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-10-24 15:52:50,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:52:50,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:52:50,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:52:50,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:52:50,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:52:50,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2024-10-24 15:52:52,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:52:52,294 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:52:52,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2024-10-24 15:52:52,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b743da9/058e017a3fab44b7a853291b70bd19eb/FLAGe537ae104 [2024-10-24 15:52:52,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b743da9/058e017a3fab44b7a853291b70bd19eb [2024-10-24 15:52:52,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:52:52,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:52:52,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:52,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:52:52,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:52:52,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:52" (1/1) ... [2024-10-24 15:52:52,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb1a79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:52, skipping insertion in model container [2024-10-24 15:52:52,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:52" (1/1) ... [2024-10-24 15:52:52,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:52:52,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:52,935 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:52:52,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:52:53,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:53,040 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:52:53,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:53,159 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:52:53,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53 WrapperNode [2024-10-24 15:52:53,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:53,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:52:53,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:52:53,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:52:53,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,251 INFO L138 Inliner]: procedures = 179, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 589 [2024-10-24 15:52:53,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:52:53,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:52:53,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:52:53,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:52:53,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,337 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-24 15:52:53,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:52:53,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:52:53,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:52:53,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:52:53,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (1/1) ... [2024-10-24 15:52:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:52:53,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:52:53,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:52:53,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:52:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:52:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:52:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:52:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:52:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:52:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:52:53,492 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:52:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:52:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:52:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:52:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:52:53,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:52:53,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:52:53,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:52:53,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:52:53,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:52:53,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:52:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:52:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:52:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:52:53,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:52:53,688 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:52:53,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:53:00,684 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-24 15:53:00,685 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:53:00,709 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:53:00,710 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-24 15:53:00,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:53:00 BoogieIcfgContainer [2024-10-24 15:53:00,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:53:00,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:53:00,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:53:00,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:53:00,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:52:52" (1/3) ... [2024-10-24 15:53:00,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b56669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:53:00, skipping insertion in model container [2024-10-24 15:53:00,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:53" (2/3) ... [2024-10-24 15:53:00,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b56669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:53:00, skipping insertion in model container [2024-10-24 15:53:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:53:00" (3/3) ... [2024-10-24 15:53:00,719 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-1.i [2024-10-24 15:53:00,736 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:53:00,736 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:53:00,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:53:00,792 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;@5d3414e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:53:00,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:53:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 98 states have (on average 1.663265306122449) internal successors, (163), 100 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 15:53:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 15:53:00,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:00,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:00,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash -180985138, now seen corresponding path program 1 times [2024-10-24 15:53:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:00,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530768252] [2024-10-24 15:53:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:00,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:00,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 15:53:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:00,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:53:00,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:00,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:00,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530768252] [2024-10-24 15:53:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530768252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:00,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:53:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116513917] [2024-10-24 15:53:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:53:00,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:01,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:53:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:53:01,024 INFO L87 Difference]: Start difference. First operand has 105 states, 98 states have (on average 1.663265306122449) internal successors, (163), 100 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:01,067 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2024-10-24 15:53:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:53:01,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 15:53:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:01,077 INFO L225 Difference]: With dead ends: 104 [2024-10-24 15:53:01,077 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 15:53:01,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:53:01,081 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:01,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:53:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 15:53:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 15:53:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 98 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 15:53:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2024-10-24 15:53:01,123 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 8 [2024-10-24 15:53:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:01,124 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2024-10-24 15:53:01,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2024-10-24 15:53:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 15:53:01,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:01,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:01,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 15:53:01,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:01,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:01,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318948, now seen corresponding path program 1 times [2024-10-24 15:53:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209731348] [2024-10-24 15:53:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:01,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:01,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:01,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:01,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 15:53:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:01,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 15:53:01,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:01,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:01,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209731348] [2024-10-24 15:53:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209731348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:53:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612901583] [2024-10-24 15:53:01,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:53:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:53:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:53:01,446 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:01,609 INFO L93 Difference]: Finished difference Result 192 states and 245 transitions. [2024-10-24 15:53:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:53:01,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 15:53:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:01,618 INFO L225 Difference]: With dead ends: 192 [2024-10-24 15:53:01,618 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 15:53:01,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:53:01,620 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:01,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 274 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 15:53:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 104. [2024-10-24 15:53:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 99 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 15:53:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2024-10-24 15:53:01,636 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 8 [2024-10-24 15:53:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:01,636 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2024-10-24 15:53:01,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2024-10-24 15:53:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 15:53:01,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:01,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:01,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:01,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:01,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:01,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1693577765, now seen corresponding path program 1 times [2024-10-24 15:53:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541326203] [2024-10-24 15:53:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:01,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:01,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:01,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:01,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 15:53:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:02,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:53:02,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:02,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:02,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541326203] [2024-10-24 15:53:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541326203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:53:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661055635] [2024-10-24 15:53:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:02,234 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:02,390 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2024-10-24 15:53:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:53:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 15:53:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:02,393 INFO L225 Difference]: With dead ends: 107 [2024-10-24 15:53:02,394 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 15:53:02,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:53:02,395 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:02,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 274 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 15:53:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-24 15:53:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 101 states have (on average 1.188118811881188) internal successors, (120), 102 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 15:53:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2024-10-24 15:53:02,411 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 63 [2024-10-24 15:53:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:02,411 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2024-10-24 15:53:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2024-10-24 15:53:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 15:53:02,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:02,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:02,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 15:53:02,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:02,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 366732367, now seen corresponding path program 1 times [2024-10-24 15:53:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721555867] [2024-10-24 15:53:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:02,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:02,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:02,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 15:53:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:02,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:53:02,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:03,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:03,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:03,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721555867] [2024-10-24 15:53:03,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721555867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:03,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:03,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:53:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193036648] [2024-10-24 15:53:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:03,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:53:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:53:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:53:03,115 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:03,232 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2024-10-24 15:53:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:53:03,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 15:53:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:03,236 INFO L225 Difference]: With dead ends: 101 [2024-10-24 15:53:03,236 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 15:53:03,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:53:03,237 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:03,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 15:53:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 15:53:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 96 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 15:53:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2024-10-24 15:53:03,248 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 63 [2024-10-24 15:53:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2024-10-24 15:53:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2024-10-24 15:53:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 15:53:03,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:03,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:03,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 15:53:03,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:03,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:03,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1684251631, now seen corresponding path program 1 times [2024-10-24 15:53:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:03,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958573121] [2024-10-24 15:53:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:03,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:03,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 15:53:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:03,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:53:03,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:04,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:04,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958573121] [2024-10-24 15:53:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958573121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:04,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:53:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288394582] [2024-10-24 15:53:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:04,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:53:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:53:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:53:04,162 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:04,573 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2024-10-24 15:53:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:53:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-24 15:53:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:04,579 INFO L225 Difference]: With dead ends: 137 [2024-10-24 15:53:04,579 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 15:53:04,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:53:04,580 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:04,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:53:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 15:53:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-24 15:53:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.1145038167938932) internal successors, (146), 132 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 15:53:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-10-24 15:53:04,596 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 63 [2024-10-24 15:53:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:04,597 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-10-24 15:53:04,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:53:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-10-24 15:53:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 15:53:04,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:04,598 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 15:53:04,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:04,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:04,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:04,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1458899198, now seen corresponding path program 1 times [2024-10-24 15:53:04,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:04,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438360396] [2024-10-24 15:53:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:04,804 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:04,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 15:53:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:05,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:53:05,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:53:05,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:05,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438360396] [2024-10-24 15:53:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438360396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:05,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:05,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:53:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221588705] [2024-10-24 15:53:05,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:05,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:05,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:05,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:05,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:05,231 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:53:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:05,283 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2024-10-24 15:53:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:53:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2024-10-24 15:53:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:05,286 INFO L225 Difference]: With dead ends: 139 [2024-10-24 15:53:05,286 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 15:53:05,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:05,287 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:05,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 326 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:53:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 15:53:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-24 15:53:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 132 states have (on average 1.121212121212121) internal successors, (148), 134 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 15:53:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2024-10-24 15:53:05,295 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 76 [2024-10-24 15:53:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2024-10-24 15:53:05,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:53:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2024-10-24 15:53:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 15:53:05,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:05,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:05,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:05,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 661275064, now seen corresponding path program 1 times [2024-10-24 15:53:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:05,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765757776] [2024-10-24 15:53:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:05,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:05,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:05,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:05,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 15:53:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:05,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:53:05,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:53:05,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:53:06,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:06,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765757776] [2024-10-24 15:53:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765757776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:06,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:53:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810281037] [2024-10-24 15:53:06,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:06,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:53:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:06,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:53:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:53:06,067 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:06,295 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2024-10-24 15:53:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:53:06,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2024-10-24 15:53:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:06,297 INFO L225 Difference]: With dead ends: 148 [2024-10-24 15:53:06,297 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 15:53:06,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 15:53:06,298 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 5 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:06,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 326 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:53:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 15:53:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-10-24 15:53:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 139 states have (on average 1.158273381294964) internal successors, (161), 141 states have internal predecessors, (161), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 15:53:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2024-10-24 15:53:06,311 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 78 [2024-10-24 15:53:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:06,312 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2024-10-24 15:53:06,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2024-10-24 15:53:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 15:53:06,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:06,313 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-24 15:53:06,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 15:53:06,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:06,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:06,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -774144766, now seen corresponding path program 2 times [2024-10-24 15:53:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50636878] [2024-10-24 15:53:06,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:06,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:06,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:06,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:06,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 15:53:06,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:53:06,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:06,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:53:06,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:53:07,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 15:53:07,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50636878] [2024-10-24 15:53:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50636878] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:07,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:53:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399115556] [2024-10-24 15:53:07,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:07,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:53:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:53:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:53:07,368 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:07,936 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2024-10-24 15:53:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:53:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-24 15:53:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:07,939 INFO L225 Difference]: With dead ends: 159 [2024-10-24 15:53:07,939 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 15:53:07,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:53:07,940 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:07,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 753 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:53:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 15:53:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-10-24 15:53:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 148 states have (on average 1.1689189189189189) internal successors, (173), 150 states have internal predecessors, (173), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 15:53:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2024-10-24 15:53:07,947 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 82 [2024-10-24 15:53:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:07,948 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2024-10-24 15:53:07,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2024-10-24 15:53:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 15:53:07,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:07,949 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-24 15:53:07,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 15:53:08,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:08,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:08,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 352570230, now seen corresponding path program 3 times [2024-10-24 15:53:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:08,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644756830] [2024-10-24 15:53:08,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:53:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:08,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:08,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 15:53:08,491 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:53:08,491 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:08,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:53:08,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-24 15:53:08,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:08,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:08,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644756830] [2024-10-24 15:53:08,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644756830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:08,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:08,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:53:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853480760] [2024-10-24 15:53:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:08,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:08,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:08,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:08,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:08,694 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:11,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:53:15,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:53:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:16,657 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2024-10-24 15:53:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:53:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-10-24 15:53:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:16,661 INFO L225 Difference]: With dead ends: 157 [2024-10-24 15:53:16,661 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 15:53:16,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:53:16,662 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 122 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:16,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2024-10-24 15:53:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 15:53:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-24 15:53:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 149 states have (on average 1.1610738255033557) internal successors, (173), 151 states have internal predecessors, (173), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 15:53:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2024-10-24 15:53:16,667 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 91 [2024-10-24 15:53:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:16,668 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2024-10-24 15:53:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2024-10-24 15:53:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 15:53:16,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:16,670 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-24 15:53:16,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 15:53:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:16,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:16,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash -903752975, now seen corresponding path program 1 times [2024-10-24 15:53:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:16,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340310514] [2024-10-24 15:53:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:16,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:16,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 15:53:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:17,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:53:17,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 15:53:17,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-24 15:53:18,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:18,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340310514] [2024-10-24 15:53:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340310514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:18,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:53:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87277724] [2024-10-24 15:53:18,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:18,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:53:18,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:18,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:53:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:53:18,119 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:19,992 INFO L93 Difference]: Finished difference Result 178 states and 217 transitions. [2024-10-24 15:53:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:53:19,994 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 92 [2024-10-24 15:53:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:19,995 INFO L225 Difference]: With dead ends: 178 [2024-10-24 15:53:19,995 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 15:53:19,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:53:19,997 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 14 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:19,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1290 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 15:53:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 15:53:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2024-10-24 15:53:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 167 states have (on average 1.1796407185628743) internal successors, (197), 169 states have internal predecessors, (197), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 15:53:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 204 transitions. [2024-10-24 15:53:20,008 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 204 transitions. Word has length 92 [2024-10-24 15:53:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:20,008 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 204 transitions. [2024-10-24 15:53:20,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 204 transitions. [2024-10-24 15:53:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 15:53:20,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:20,010 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-24 15:53:20,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:20,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:20,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 655381745, now seen corresponding path program 2 times [2024-10-24 15:53:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:20,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40698347] [2024-10-24 15:53:20,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:20,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:20,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:20,214 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:20,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 15:53:20,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:53:20,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:20,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 15:53:20,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 15:53:21,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 15:53:22,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40698347] [2024-10-24 15:53:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40698347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:22,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:53:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842908047] [2024-10-24 15:53:22,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:53:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:53:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:53:22,898 INFO L87 Difference]: Start difference. First operand 175 states and 204 transitions. Second operand has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:29,236 INFO L93 Difference]: Finished difference Result 212 states and 273 transitions. [2024-10-24 15:53:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:53:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2024-10-24 15:53:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:29,238 INFO L225 Difference]: With dead ends: 212 [2024-10-24 15:53:29,238 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 15:53:29,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:53:29,241 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 25 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:29,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2574 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 15:53:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 15:53:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2024-10-24 15:53:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 201 states have (on average 1.208955223880597) internal successors, (243), 203 states have internal predecessors, (243), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 15:53:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 250 transitions. [2024-10-24 15:53:29,247 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 250 transitions. Word has length 110 [2024-10-24 15:53:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:29,248 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 250 transitions. [2024-10-24 15:53:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 250 transitions. [2024-10-24 15:53:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 15:53:29,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:29,249 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-24 15:53:29,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 15:53:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:29,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1851470129, now seen corresponding path program 3 times [2024-10-24 15:53:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161972784] [2024-10-24 15:53:29,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:53:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:29,454 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:29,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 15:53:29,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:53:29,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:29,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:53:29,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-10-24 15:53:30,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-10-24 15:53:30,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161972784] [2024-10-24 15:53:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161972784] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:30,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-24 15:53:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873155973] [2024-10-24 15:53:30,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:30,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:53:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:53:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:53:30,212 INFO L87 Difference]: Start difference. First operand 209 states and 250 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:30,494 INFO L93 Difference]: Finished difference Result 402 states and 479 transitions. [2024-10-24 15:53:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:53:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 144 [2024-10-24 15:53:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:30,497 INFO L225 Difference]: With dead ends: 402 [2024-10-24 15:53:30,497 INFO L226 Difference]: Without dead ends: 402 [2024-10-24 15:53:30,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 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-10-24 15:53:30,497 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 361 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:30,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 545 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:53:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-24 15:53:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-10-24 15:53:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 391 states have (on average 1.184143222506394) internal successors, (463), 393 states have internal predecessors, (463), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-24 15:53:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 479 transitions. [2024-10-24 15:53:30,509 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 479 transitions. Word has length 144 [2024-10-24 15:53:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:30,510 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 479 transitions. [2024-10-24 15:53:30,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 479 transitions. [2024-10-24 15:53:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-24 15:53:30,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:30,514 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:30,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:30,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1448588688, now seen corresponding path program 1 times [2024-10-24 15:53:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118263568] [2024-10-24 15:53:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:30,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:30,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:30,718 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:30,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 15:53:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:32,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:53:32,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-24 15:53:32,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-24 15:53:34,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:34,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118263568] [2024-10-24 15:53:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118263568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:34,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:53:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781993612] [2024-10-24 15:53:34,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:53:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:53:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:53:34,576 INFO L87 Difference]: Start difference. First operand 402 states and 479 transitions. Second operand has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:53:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:41,481 INFO L93 Difference]: Finished difference Result 429 states and 537 transitions. [2024-10-24 15:53:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:53:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 309 [2024-10-24 15:53:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:41,485 INFO L225 Difference]: With dead ends: 429 [2024-10-24 15:53:41,485 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 15:53:41,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:53:41,488 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 27 mSDsluCounter, 2546 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:41,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2655 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 15:53:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 15:53:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2024-10-24 15:53:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 416 states have (on average 1.2331730769230769) internal successors, (513), 418 states have internal predecessors, (513), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-24 15:53:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 529 transitions. [2024-10-24 15:53:41,502 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 529 transitions. Word has length 309 [2024-10-24 15:53:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:41,503 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 529 transitions. [2024-10-24 15:53:41,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:53:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 529 transitions. [2024-10-24 15:53:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-24 15:53:41,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:41,508 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:41,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 15:53:41,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:41,709 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:41,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2044148156, now seen corresponding path program 2 times [2024-10-24 15:53:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:41,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806870322] [2024-10-24 15:53:41,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:53:41,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:41,712 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:53:41,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 15:53:43,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:53:43,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:43,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 2227 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 15:53:43,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4702 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-24 15:53:45,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4702 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-24 15:53:51,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806870322] [2024-10-24 15:53:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806870322] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:51,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:51,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-24 15:53:51,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271256129] [2024-10-24 15:53:51,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:51,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-24 15:53:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:51,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-24 15:53:51,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-24 15:53:51,438 INFO L87 Difference]: Start difference. First operand 427 states and 529 transitions. Second operand has 102 states, 100 states have (on average 2.11) internal successors, (211), 102 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)