./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_JEN_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-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 f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:30:03,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:30:03,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:30:03,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:30:03,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:30:03,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:30:03,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:30:03,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:30:03,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:30:03,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:30:03,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:30:03,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:30:03,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:30:03,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:30:03,975 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:30:03,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:30:03,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:30:03,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:30:03,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:30:03,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:30:03,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:30:03,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:30:03,979 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:30:03,980 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:30:03,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:30:03,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:30:03,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:30:03,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:30:03,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:30:03,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:30:03,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:30:03,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:30:03,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:30:03,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:30:03,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:30:03,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:30:03,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:30:03,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:30:03,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:30:03,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:30:03,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:30:03,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:30:03,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:30:03,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:30:03,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:30:03,985 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 -> f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 [2024-10-14 17:30:04,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:30:04,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:30:04,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:30:04,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:30:04,198 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:30:04,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2024-10-14 17:30:05,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:30:05,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:30:05,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2024-10-14 17:30:05,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d999cb2f7/e57717ff564a47d68acf9262763a9024/FLAGa5cb442f6 [2024-10-14 17:30:05,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d999cb2f7/e57717ff564a47d68acf9262763a9024 [2024-10-14 17:30:05,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:30:05,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:30:05,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:30:05,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:30:05,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:30:05,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:30:05" (1/1) ... [2024-10-14 17:30:05,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf528ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:05, skipping insertion in model container [2024-10-14 17:30:05,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:30:05" (1/1) ... [2024-10-14 17:30:05,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:30:06,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:30:06,099 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 17:30:06,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6680353c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:06, skipping insertion in model container [2024-10-14 17:30:06,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:30:06,101 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:30:06,102 INFO L158 Benchmark]: Toolchain (without parser) took 450.24ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 81.5MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:30:06,103 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:30:06,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.35ms. Allocated memory is still 176.2MB. Free memory was 101.8MB in the beginning and 81.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:30:06,104 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.16ms. Allocated memory is still 176.2MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.35ms. Allocated memory is still 176.2MB. Free memory was 101.8MB in the beginning and 81.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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_JEN_test3-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 f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:30:07,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:30:07,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:30:07,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:30:07,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:30:07,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:30:07,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:30:07,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:30:07,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:30:07,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:30:07,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:30:07,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:30:07,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:30:07,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:30:07,727 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:30:07,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:30:07,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:30:07,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:30:07,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:30:07,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:30:07,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:30:07,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:30:07,731 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:30:07,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:30:07,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:30:07,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:30:07,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:30:07,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:30:07,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:30:07,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:30:07,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:30:07,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:30:07,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:30:07,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:30:07,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:30:07,736 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:30:07,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:30:07,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:30:07,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:30:07,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:30:07,737 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:30:07,737 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 -> f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 [2024-10-14 17:30:07,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:30:07,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:30:07,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:30:07,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:30:07,993 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:30:07,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2024-10-14 17:30:09,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:30:09,459 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:30:09,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2024-10-14 17:30:09,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcc2ca55/c88e5848372d441dbf329d56a12f2eec/FLAG718a27be0 [2024-10-14 17:30:09,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcc2ca55/c88e5848372d441dbf329d56a12f2eec [2024-10-14 17:30:09,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:30:09,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:30:09,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:30:09,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:30:09,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:30:09,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:30:09" (1/1) ... [2024-10-14 17:30:09,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745c0f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:09, skipping insertion in model container [2024-10-14 17:30:09,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:30:09" (1/1) ... [2024-10-14 17:30:09,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:30:09,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:30:09,936 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:30:09,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:30:10,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:30:10,015 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:30:10,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:30:10,125 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:30:10,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10 WrapperNode [2024-10-14 17:30:10,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:30:10,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:30:10,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:30:10,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:30:10,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,215 INFO L138 Inliner]: procedures = 180, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1050 [2024-10-14 17:30:10,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:30:10,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:30:10,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:30:10,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:30:10,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,290 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 34, 219]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-14 17:30:10,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:30:10,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:30:10,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:30:10,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:30:10,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (1/1) ... [2024-10-14 17:30:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:30:10,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:30:10,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:30:10,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:30:10,424 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 17:30:10,424 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 17:30:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:30:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:30:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:30:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:30:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:30:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 17:30:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:30:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:30:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:30:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:30:10,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:30:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:30:10,595 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:30:10,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:30:17,216 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-10-14 17:30:17,216 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:30:17,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:30:17,240 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 17:30:17,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:30:17 BoogieIcfgContainer [2024-10-14 17:30:17,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:30:17,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:30:17,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:30:17,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:30:17,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:30:09" (1/3) ... [2024-10-14 17:30:17,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6acd65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:30:17, skipping insertion in model container [2024-10-14 17:30:17,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:30:10" (2/3) ... [2024-10-14 17:30:17,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6acd65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:30:17, skipping insertion in model container [2024-10-14 17:30:17,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:30:17" (3/3) ... [2024-10-14 17:30:17,246 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test3-1.i [2024-10-14 17:30:17,257 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:30:17,257 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:30:17,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:30:17,303 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;@3ec047d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:30:17,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:30:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 192 states have (on average 1.6822916666666667) internal successors, (323), 201 states have internal predecessors, (323), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 17:30:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:30:17,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:17,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:17,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:17,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash 212559925, now seen corresponding path program 1 times [2024-10-14 17:30:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369822205] [2024-10-14 17:30:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:17,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:17,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:17,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:30:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:17,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:30:17,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:30:17,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:17,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369822205] [2024-10-14 17:30:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369822205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:17,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:30:17,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946361590] [2024-10-14 17:30:17,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:17,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:30:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:30:17,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:30:17,526 INFO L87 Difference]: Start difference. First operand has 208 states, 192 states have (on average 1.6822916666666667) internal successors, (323), 201 states have internal predecessors, (323), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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-14 17:30:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:17,576 INFO L93 Difference]: Finished difference Result 206 states and 271 transitions. [2024-10-14 17:30:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:30:17,581 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-14 17:30:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:17,588 INFO L225 Difference]: With dead ends: 206 [2024-10-14 17:30:17,589 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 17:30:17,590 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-14 17:30:17,594 INFO L432 NwaCegarLoop]: 267 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, 267 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:17,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:30:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 17:30:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-10-14 17:30:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 191 states have (on average 1.3193717277486912) internal successors, (252), 198 states have internal predecessors, (252), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 17:30:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 270 transitions. [2024-10-14 17:30:17,658 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 270 transitions. Word has length 8 [2024-10-14 17:30:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:17,662 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 270 transitions. [2024-10-14 17:30:17,662 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-14 17:30:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2024-10-14 17:30:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:30:17,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:17,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:17,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 17:30:17,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:17,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 615855570, now seen corresponding path program 1 times [2024-10-14 17:30:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3751294] [2024-10-14 17:30:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:17,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:17,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:30:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:18,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:30:18,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:18,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:30:18,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:30:18,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:30:18,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 17:30:18,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:30:18,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 17:30:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:30:18,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:18,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3751294] [2024-10-14 17:30:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3751294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:18,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:30:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231948706] [2024-10-14 17:30:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:18,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:30:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:30:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:18,129 INFO L87 Difference]: Start difference. First operand 205 states and 270 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:30:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:18,568 INFO L93 Difference]: Finished difference Result 395 states and 526 transitions. [2024-10-14 17:30:18,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:30:18,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-10-14 17:30:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:18,571 INFO L225 Difference]: With dead ends: 395 [2024-10-14 17:30:18,571 INFO L226 Difference]: Without dead ends: 395 [2024-10-14 17:30:18,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:30:18,572 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 236 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:18,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 737 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:30:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-14 17:30:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 207. [2024-10-14 17:30:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 193 states have (on average 1.3160621761658031) internal successors, (254), 200 states have internal predecessors, (254), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 17:30:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 272 transitions. [2024-10-14 17:30:18,604 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 272 transitions. Word has length 10 [2024-10-14 17:30:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:18,604 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 272 transitions. [2024-10-14 17:30:18,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:30:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 272 transitions. [2024-10-14 17:30:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 17:30:18,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:18,606 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:18,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:30:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:18,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1335770244, now seen corresponding path program 1 times [2024-10-14 17:30:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942719235] [2024-10-14 17:30:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:18,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:18,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:30:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:19,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:30:19,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:30:19,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:19,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942719235] [2024-10-14 17:30:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942719235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:30:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432135012] [2024-10-14 17:30:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:19,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:30:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:30:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:19,126 INFO L87 Difference]: Start difference. First operand 207 states and 272 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:30:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:19,244 INFO L93 Difference]: Finished difference Result 210 states and 267 transitions. [2024-10-14 17:30:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:30:19,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-10-14 17:30:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:19,246 INFO L225 Difference]: With dead ends: 210 [2024-10-14 17:30:19,246 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 17:30:19,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:30:19,248 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 30 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:19,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 694 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:30:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 17:30:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-10-14 17:30:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 196 states have (on average 1.2704081632653061) internal successors, (249), 203 states have internal predecessors, (249), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 17:30:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2024-10-14 17:30:19,261 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 66 [2024-10-14 17:30:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2024-10-14 17:30:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:30:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2024-10-14 17:30:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 17:30:19,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:19,265 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:30:19,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:19,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:19,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1095469320, now seen corresponding path program 1 times [2024-10-14 17:30:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724684457] [2024-10-14 17:30:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:19,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:19,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:19,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:30:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:19,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:30:19,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:30:19,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:19,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724684457] [2024-10-14 17:30:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724684457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:19,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:19,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:30:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778483297] [2024-10-14 17:30:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:19,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:30:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:30:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:30:19,942 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:30:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:20,280 INFO L93 Difference]: Finished difference Result 321 states and 404 transitions. [2024-10-14 17:30:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:30:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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 66 [2024-10-14 17:30:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:20,282 INFO L225 Difference]: With dead ends: 321 [2024-10-14 17:30:20,282 INFO L226 Difference]: Without dead ends: 321 [2024-10-14 17:30:20,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:30:20,283 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 90 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:20,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 531 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:30:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-14 17:30:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-10-14 17:30:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 304 states have (on average 1.2598684210526316) internal successors, (383), 311 states have internal predecessors, (383), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 17:30:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 401 transitions. [2024-10-14 17:30:20,299 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 401 transitions. Word has length 66 [2024-10-14 17:30:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:20,300 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 401 transitions. [2024-10-14 17:30:20,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:30:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 401 transitions. [2024-10-14 17:30:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 17:30:20,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:20,303 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:20,312 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:30:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:20,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:20,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1489101063, now seen corresponding path program 1 times [2024-10-14 17:30:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357415429] [2024-10-14 17:30:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:20,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:20,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:20,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:30:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:20,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:30:20,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:30:20,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:20,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:20,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357415429] [2024-10-14 17:30:20,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357415429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:20,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:20,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:30:20,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754419794] [2024-10-14 17:30:20,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:20,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:30:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:20,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:30:20,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:20,850 INFO L87 Difference]: Start difference. First operand 318 states and 401 transitions. Second operand has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:30:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:20,905 INFO L93 Difference]: Finished difference Result 320 states and 404 transitions. [2024-10-14 17:30:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:30:20,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 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 79 [2024-10-14 17:30:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:20,907 INFO L225 Difference]: With dead ends: 320 [2024-10-14 17:30:20,907 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 17:30:20,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:20,908 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:20,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:30:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 17:30:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-10-14 17:30:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 305 states have (on average 1.2622950819672132) internal successors, (385), 313 states have internal predecessors, (385), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 404 transitions. [2024-10-14 17:30:20,914 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 404 transitions. Word has length 79 [2024-10-14 17:30:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 404 transitions. [2024-10-14 17:30:20,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:30:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 404 transitions. [2024-10-14 17:30:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 17:30:20,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:20,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:20,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 17:30:21,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:21,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:21,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash 599374851, now seen corresponding path program 1 times [2024-10-14 17:30:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067786575] [2024-10-14 17:30:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:21,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:21,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:21,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:30:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:21,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:30:21,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:30:21,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:30:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:30:21,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067786575] [2024-10-14 17:30:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067786575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:30:21,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:30:21,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:30:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133541521] [2024-10-14 17:30:21,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:30:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:30:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:30:21,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:30:21,549 INFO L87 Difference]: Start difference. First operand 320 states and 404 transitions. Second operand has 8 states, 6 states have (on average 13.833333333333334) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:21,690 INFO L93 Difference]: Finished difference Result 329 states and 418 transitions. [2024-10-14 17:30:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:30:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.833333333333334) internal successors, (83), 8 states have internal predecessors, (83), 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 81 [2024-10-14 17:30:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:21,692 INFO L225 Difference]: With dead ends: 329 [2024-10-14 17:30:21,692 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 17:30:21,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:30:21,692 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:21,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1008 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:30:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 17:30:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2024-10-14 17:30:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 312 states have (on average 1.2756410256410255) internal successors, (398), 320 states have internal predecessors, (398), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 417 transitions. [2024-10-14 17:30:21,701 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 417 transitions. Word has length 81 [2024-10-14 17:30:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:21,702 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 417 transitions. [2024-10-14 17:30:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.833333333333334) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 417 transitions. [2024-10-14 17:30:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 17:30:21,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:21,703 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:21,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 17:30:21,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:21,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1793952551, now seen corresponding path program 2 times [2024-10-14 17:30:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818617451] [2024-10-14 17:30:21,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:30:21,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:21,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:21,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:21,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:30:22,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:30:22,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:30:22,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:30:22,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:22,134 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:30:22,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:30:22,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:30:22,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-14 17:30:22,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:30:22,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 17:30:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:30:22,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:22,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:22,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818617451] [2024-10-14 17:30:22,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818617451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:22,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:22,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:30:22,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595468844] [2024-10-14 17:30:22,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:22,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:30:22,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:30:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:22,208 INFO L87 Difference]: Start difference. First operand 328 states and 417 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:22,565 INFO L93 Difference]: Finished difference Result 488 states and 628 transitions. [2024-10-14 17:30:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:30:22,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 85 [2024-10-14 17:30:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:22,568 INFO L225 Difference]: With dead ends: 488 [2024-10-14 17:30:22,568 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 17:30:22,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:30:22,569 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 207 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:22,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 759 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:30:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 17:30:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 330. [2024-10-14 17:30:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 314 states have (on average 1.2738853503184713) internal successors, (400), 322 states have internal predecessors, (400), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 419 transitions. [2024-10-14 17:30:22,579 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 419 transitions. Word has length 85 [2024-10-14 17:30:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 419 transitions. [2024-10-14 17:30:22,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 419 transitions. [2024-10-14 17:30:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 17:30:22,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:22,581 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:22,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:30:22,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:22,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:22,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash -327216987, now seen corresponding path program 1 times [2024-10-14 17:30:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382159381] [2024-10-14 17:30:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:22,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:22,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:22,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:30:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:23,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:30:23,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:30:23,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:30:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:30:23,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382159381] [2024-10-14 17:30:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382159381] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:30:23,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:30:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:30:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340827731] [2024-10-14 17:30:23,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:30:23,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:30:23,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:30:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:30:23,393 INFO L87 Difference]: Start difference. First operand 330 states and 419 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:23,802 INFO L93 Difference]: Finished difference Result 342 states and 438 transitions. [2024-10-14 17:30:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:30:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2024-10-14 17:30:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:23,804 INFO L225 Difference]: With dead ends: 342 [2024-10-14 17:30:23,804 INFO L226 Difference]: Without dead ends: 340 [2024-10-14 17:30:23,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:30:23,805 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 8 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:23,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1762 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:30:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-14 17:30:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2024-10-14 17:30:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 323 states have (on average 1.2755417956656347) internal successors, (412), 331 states have internal predecessors, (412), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 431 transitions. [2024-10-14 17:30:23,811 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 431 transitions. Word has length 122 [2024-10-14 17:30:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:23,812 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 431 transitions. [2024-10-14 17:30:23,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 431 transitions. [2024-10-14 17:30:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 17:30:23,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:23,813 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:23,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:30:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:24,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1855486078, now seen corresponding path program 2 times [2024-10-14 17:30:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236588842] [2024-10-14 17:30:24,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:30:24,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:24,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:24,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:24,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:30:24,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:30:24,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:30:24,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:30:24,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-14 17:30:24,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:24,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236588842] [2024-10-14 17:30:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236588842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:30:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639321152] [2024-10-14 17:30:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:30:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:30:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:24,272 INFO L87 Difference]: Start difference. First operand 339 states and 431 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:24,367 INFO L93 Difference]: Finished difference Result 345 states and 421 transitions. [2024-10-14 17:30:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:30:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 131 [2024-10-14 17:30:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:24,370 INFO L225 Difference]: With dead ends: 345 [2024-10-14 17:30:24,370 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 17:30:24,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:30:24,371 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 30 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:24,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 661 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:30:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 17:30:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-10-14 17:30:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 329 states have (on average 1.221884498480243) internal successors, (402), 337 states have internal predecessors, (402), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 421 transitions. [2024-10-14 17:30:24,379 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 421 transitions. Word has length 131 [2024-10-14 17:30:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:24,379 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 421 transitions. [2024-10-14 17:30:24,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 421 transitions. [2024-10-14 17:30:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 17:30:24,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:24,380 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:24,389 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 (10)] Forceful destruction successful, exit code 0 [2024-10-14 17:30:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:24,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash -505556234, now seen corresponding path program 1 times [2024-10-14 17:30:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179895577] [2024-10-14 17:30:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:24,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:24,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:24,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:24,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 17:30:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:25,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:30:25,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:30:25,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:30:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:30:25,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179895577] [2024-10-14 17:30:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179895577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:30:25,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:30:25,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:30:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436172733] [2024-10-14 17:30:25,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:30:25,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:30:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:30:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:30:25,526 INFO L87 Difference]: Start difference. First operand 345 states and 421 transitions. Second operand has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:26,759 INFO L93 Difference]: Finished difference Result 366 states and 458 transitions. [2024-10-14 17:30:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:30:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-14 17:30:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:26,761 INFO L225 Difference]: With dead ends: 366 [2024-10-14 17:30:26,762 INFO L226 Difference]: Without dead ends: 364 [2024-10-14 17:30:26,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:30:26,763 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 13 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:26,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2885 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:30:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-14 17:30:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2024-10-14 17:30:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 347 states have (on average 1.2276657060518732) internal successors, (426), 355 states have internal predecessors, (426), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 445 transitions. [2024-10-14 17:30:26,770 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 445 transitions. Word has length 131 [2024-10-14 17:30:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 445 transitions. [2024-10-14 17:30:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 445 transitions. [2024-10-14 17:30:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 17:30:26,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:26,772 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:26,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 17:30:26,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:26,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:26,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1097496918, now seen corresponding path program 2 times [2024-10-14 17:30:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:26,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519890047] [2024-10-14 17:30:26,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:30:26,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:26,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:26,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:30:27,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:30:27,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:30:27,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:30:27,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-14 17:30:27,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:27,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519890047] [2024-10-14 17:30:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519890047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:27,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:30:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059066501] [2024-10-14 17:30:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:30:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:30:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:30:27,285 INFO L87 Difference]: Start difference. First operand 363 states and 445 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:27,336 INFO L93 Difference]: Finished difference Result 363 states and 439 transitions. [2024-10-14 17:30:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:30:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 149 [2024-10-14 17:30:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:27,338 INFO L225 Difference]: With dead ends: 363 [2024-10-14 17:30:27,338 INFO L226 Difference]: Without dead ends: 363 [2024-10-14 17:30:27,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:30:27,339 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:27,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:30:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-14 17:30:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-10-14 17:30:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 347 states have (on average 1.2103746397694524) internal successors, (420), 355 states have internal predecessors, (420), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 439 transitions. [2024-10-14 17:30:27,344 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 439 transitions. Word has length 149 [2024-10-14 17:30:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:27,344 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 439 transitions. [2024-10-14 17:30:27,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 439 transitions. [2024-10-14 17:30:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 17:30:27,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:27,345 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:27,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 17:30:27,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:27,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2118565272, now seen corresponding path program 1 times [2024-10-14 17:30:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657887296] [2024-10-14 17:30:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:27,550 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:27,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 17:30:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:28,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:30:28,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:30:28,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:30:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:30:29,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:29,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657887296] [2024-10-14 17:30:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657887296] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:30:29,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:30:29,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:30:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797704356] [2024-10-14 17:30:29,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:30:29,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:30:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:30:29,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:30:29,569 INFO L87 Difference]: Start difference. First operand 363 states and 439 transitions. Second operand has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:34,092 INFO L93 Difference]: Finished difference Result 400 states and 508 transitions. [2024-10-14 17:30:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:30:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 149 [2024-10-14 17:30:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:34,094 INFO L225 Difference]: With dead ends: 400 [2024-10-14 17:30:34,094 INFO L226 Difference]: Without dead ends: 398 [2024-10-14 17:30:34,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:30:34,096 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 26 mSDsluCounter, 6001 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6244 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:34,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6244 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 17:30:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-14 17:30:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2024-10-14 17:30:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.2230971128608923) internal successors, (466), 389 states have internal predecessors, (466), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 485 transitions. [2024-10-14 17:30:34,102 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 485 transitions. Word has length 149 [2024-10-14 17:30:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:34,102 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 485 transitions. [2024-10-14 17:30:34,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:30:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 485 transitions. [2024-10-14 17:30:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 17:30:34,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:34,103 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:34,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-14 17:30:34,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:34,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -182444680, now seen corresponding path program 2 times [2024-10-14 17:30:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:34,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32413453] [2024-10-14 17:30:34,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:30:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:34,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:34,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 17:30:35,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:30:35,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:30:35,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:30:35,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:30:35,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:30:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:30:36,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:36,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32413453] [2024-10-14 17:30:36,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32413453] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:30:36,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:30:36,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:30:36,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597917514] [2024-10-14 17:30:36,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:30:36,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:30:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:36,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:30:36,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:30:36,990 INFO L87 Difference]: Start difference. First operand 397 states and 485 transitions. Second operand has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:30:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:41,771 INFO L93 Difference]: Finished difference Result 424 states and 537 transitions. [2024-10-14 17:30:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:30:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 183 [2024-10-14 17:30:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:41,773 INFO L225 Difference]: With dead ends: 424 [2024-10-14 17:30:41,773 INFO L226 Difference]: Without dead ends: 424 [2024-10-14 17:30:41,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:30:41,775 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 26 mSDsluCounter, 6218 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6460 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:41,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6460 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 17:30:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-14 17:30:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2024-10-14 17:30:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 406 states have (on average 1.270935960591133) internal successors, (516), 414 states have internal predecessors, (516), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 535 transitions. [2024-10-14 17:30:41,781 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 535 transitions. Word has length 183 [2024-10-14 17:30:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:41,781 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 535 transitions. [2024-10-14 17:30:41,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:30:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 535 transitions. [2024-10-14 17:30:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 17:30:41,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:41,783 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:41,804 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-14 17:30:41,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:41,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2083827141, now seen corresponding path program 3 times [2024-10-14 17:30:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:41,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816699976] [2024-10-14 17:30:41,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:30:41,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:41,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:41,986 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:41,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 17:30:42,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:30:42,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:30:42,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:30:42,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4373 trivial. 0 not checked. [2024-10-14 17:30:42,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:30:42,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816699976] [2024-10-14 17:30:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816699976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:30:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:30:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:30:42,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492447866] [2024-10-14 17:30:42,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:30:42,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:30:42,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:42,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:30:42,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:30:42,633 INFO L87 Difference]: Start difference. First operand 422 states and 535 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:46,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:30:50,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:30:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:30:51,824 INFO L93 Difference]: Finished difference Result 523 states and 662 transitions. [2024-10-14 17:30:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:30:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 208 [2024-10-14 17:30:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:30:51,827 INFO L225 Difference]: With dead ends: 523 [2024-10-14 17:30:51,827 INFO L226 Difference]: Without dead ends: 523 [2024-10-14 17:30:51,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:30:51,828 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 406 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:30:51,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 485 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-10-14 17:30:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-10-14 17:30:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 510. [2024-10-14 17:30:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 494 states have (on average 1.2550607287449393) internal successors, (620), 502 states have internal predecessors, (620), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:30:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 639 transitions. [2024-10-14 17:30:51,836 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 639 transitions. Word has length 208 [2024-10-14 17:30:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:30:51,836 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 639 transitions. [2024-10-14 17:30:51,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:30:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 639 transitions. [2024-10-14 17:30:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 17:30:51,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:30:51,838 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:30:51,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 17:30:52,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:52,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:30:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:30:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2120232453, now seen corresponding path program 1 times [2024-10-14 17:30:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:30:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693531235] [2024-10-14 17:30:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:30:52,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:30:52,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:30:52,041 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:30:52,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 17:30:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:30:53,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:30:53,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:30:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:30:54,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:30:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:30:59,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:30:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693531235] [2024-10-14 17:30:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693531235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:30:59,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:30:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:30:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123189693] [2024-10-14 17:30:59,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:30:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:30:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:30:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:30:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:30:59,323 INFO L87 Difference]: Start difference. First operand 510 states and 639 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:31:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:24,669 INFO L93 Difference]: Finished difference Result 566 states and 748 transitions. [2024-10-14 17:31:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-14 17:31:24,670 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 216 [2024-10-14 17:31:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:24,672 INFO L225 Difference]: With dead ends: 566 [2024-10-14 17:31:24,672 INFO L226 Difference]: Without dead ends: 566 [2024-10-14 17:31:24,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-10-14 17:31:24,681 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 57 mSDsluCounter, 11953 mSDsCounter, 0 mSdLazyCounter, 5399 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 12195 SdHoareTripleChecker+Invalid, 5454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 5399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:24,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 12195 Invalid, 5454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 5399 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-14 17:31:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-14 17:31:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2024-10-14 17:31:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 548 states have (on average 1.3266423357664234) internal successors, (727), 556 states have internal predecessors, (727), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-14 17:31:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 746 transitions. [2024-10-14 17:31:24,690 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 746 transitions. Word has length 216 [2024-10-14 17:31:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 746 transitions. [2024-10-14 17:31:24,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:31:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 746 transitions. [2024-10-14 17:31:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-14 17:31:24,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:24,692 INFO L215 NwaCegarLoop]: trace histogram [142, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:24,715 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 (16)] Ended with exit code 0 [2024-10-14 17:31:24,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:31:24,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:24,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash 790300837, now seen corresponding path program 2 times [2024-10-14 17:31:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694705642] [2024-10-14 17:31:24,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:31:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:31:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:24,895 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:31:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 17:31:26,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:31:26,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:31:26,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-14 17:31:26,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 4458 proven. 4851 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:31:31,727 INFO L311 TraceCheckSpWp]: Computing backward predicates...