./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:21:04,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:21:04,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:21:04,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:21:04,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:21:04,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:21:04,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:21:04,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:21:04,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:21:04,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:21:04,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:21:04,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:21:04,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:21:04,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:21:04,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:21:04,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:21:04,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:21:04,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:21:04,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:21:04,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:21:04,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:21:04,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:21:04,686 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:21:04,686 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:21:04,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:21:04,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:21:04,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:21:04,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:21:04,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:21:04,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:21:04,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:21:04,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:21:04,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:21:04,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:21:04,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:21:04,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:21:04,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:21:04,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:21:04,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:21:04,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:21:04,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:21:04,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:21:04,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:21:04,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:21:04,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:21:04,691 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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2024-11-19 06:21:04,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:21:04,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:21:04,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:21:04,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:21:04,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:21:04,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-19 06:21:06,278 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:21:06,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:21:06,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-19 06:21:06,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef697cc7/17fbbf4f91ba434a9a1afc1ec5bf4d85/FLAG603b583a9 [2024-11-19 06:21:06,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef697cc7/17fbbf4f91ba434a9a1afc1ec5bf4d85 [2024-11-19 06:21:06,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:21:06,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:21:06,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:06,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:21:06,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:21:06,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:06" (1/1) ... [2024-11-19 06:21:06,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61061a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:06, skipping insertion in model container [2024-11-19 06:21:06,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:06" (1/1) ... [2024-11-19 06:21:06,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:21:07,040 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,072 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,077 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,081 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,089 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,126 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,127 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,132 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,132 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,134 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,139 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,144 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:07,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:07,170 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:21:07,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d8d3dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:07, skipping insertion in model container [2024-11-19 06:21:07,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:07,172 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:21:07,176 INFO L158 Benchmark]: Toolchain (without parser) took 599.21ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 51.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 06:21:07,177 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 146.8MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:21:07,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.73ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 51.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 06:21:07,178 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.65ms. Allocated memory is still 146.8MB. Free memory is still 110.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.73ms. Allocated memory is still 146.8MB. Free memory was 75.1MB in the beginning and 51.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:21:09,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:21:09,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:21:09,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:21:09,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:21:09,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:21:09,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:21:09,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:21:09,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:21:09,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:21:09,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:21:09,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:21:09,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:21:09,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:21:09,237 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:21:09,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:21:09,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:21:09,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:21:09,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:21:09,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:21:09,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:21:09,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:21:09,243 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:21:09,243 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:21:09,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:21:09,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:21:09,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:21:09,244 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:21:09,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:21:09,244 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:21:09,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:21:09,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:21:09,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:21:09,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:21:09,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:21:09,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:21:09,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:21:09,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:21:09,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:21:09,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:21:09,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:21:09,248 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:21:09,249 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:21:09,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:21:09,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:21:09,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:21:09,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:21:09,250 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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2024-11-19 06:21:09,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:21:09,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:21:09,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:21:09,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:21:09,568 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:21:09,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-19 06:21:10,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:21:11,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:21:11,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-19 06:21:11,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00ec9dd5/be84c30ba947415d91449afbf81d4065/FLAG3da010a79 [2024-11-19 06:21:11,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00ec9dd5/be84c30ba947415d91449afbf81d4065 [2024-11-19 06:21:11,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:21:11,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:21:11,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:11,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:21:11,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:21:11,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:11" (1/1) ... [2024-11-19 06:21:11,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d70df52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:11, skipping insertion in model container [2024-11-19 06:21:11,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:11" (1/1) ... [2024-11-19 06:21:11,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:21:11,697 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,721 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,726 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,748 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,805 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,805 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,807 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,807 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,816 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,818 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,827 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,827 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,835 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,839 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:11,875 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:21:11,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:21:11,920 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,930 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,931 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,964 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,965 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,966 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,967 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,968 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,972 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,973 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,974 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,976 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,978 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:11,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:11,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:21:12,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:12,084 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:21:12,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12 WrapperNode [2024-11-19 06:21:12,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:12,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:21:12,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:21:12,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:21:12,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,184 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1063 [2024-11-19 06:21:12,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:21:12,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:21:12,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:21:12,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:21:12,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,285 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 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, 50, 4]. [2024-11-19 06:21:12,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:21:12,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:21:12,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:21:12,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:21:12,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (1/1) ... [2024-11-19 06:21:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:21:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:21:12,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:21:12,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:21:12,421 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:21:12,421 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:21:12,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:21:12,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:21:12,422 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:21:12,425 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:21:12,425 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:21:12,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:21:12,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:21:12,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:21:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:21:12,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:21:12,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:21:12,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:21:19,558 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-11-19 06:21:19,558 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:21:19,573 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:21:19,574 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 06:21:19,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:21:19 BoogieIcfgContainer [2024-11-19 06:21:19,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:21:19,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:21:19,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:21:19,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:21:19,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:21:11" (1/3) ... [2024-11-19 06:21:19,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464c65ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:21:19, skipping insertion in model container [2024-11-19 06:21:19,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:12" (2/3) ... [2024-11-19 06:21:19,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464c65ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:21:19, skipping insertion in model container [2024-11-19 06:21:19,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:21:19" (3/3) ... [2024-11-19 06:21:19,580 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-2.i [2024-11-19 06:21:19,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:21:19,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:21:19,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:21:19,645 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;@4c16cb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:21:19,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:21:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 201 states have (on average 1.6616915422885572) internal successors, (334), 210 states have internal predecessors, (334), 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-11-19 06:21:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:21:19,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:19,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:19,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:19,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1666316162, now seen corresponding path program 1 times [2024-11-19 06:21:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67630994] [2024-11-19 06:21:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:19,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:19,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:19,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:21:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:19,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:21:19,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:21:19,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:19,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67630994] [2024-11-19 06:21:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67630994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:19,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:19,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:21:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568499288] [2024-11-19 06:21:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:19,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:21:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:21:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:21:19,866 INFO L87 Difference]: Start difference. First operand has 217 states, 201 states have (on average 1.6616915422885572) internal successors, (334), 210 states have internal predecessors, (334), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:21:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:19,892 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2024-11-19 06:21:19,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:21:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 06:21:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:19,901 INFO L225 Difference]: With dead ends: 215 [2024-11-19 06:21:19,902 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 06:21:19,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:21:19,906 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:19,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:21:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 06:21:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-19 06:21:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 199 states have (on average 1.3165829145728642) internal successors, (262), 206 states have internal predecessors, (262), 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-11-19 06:21:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2024-11-19 06:21:20,027 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 11 [2024-11-19 06:21:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:20,028 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2024-11-19 06:21:20,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:21:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2024-11-19 06:21:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:21:20,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:20,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:20,033 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 (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:21:20,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:20,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:20,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:20,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1435559136, now seen corresponding path program 1 times [2024-11-19 06:21:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538713524] [2024-11-19 06:21:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:20,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:20,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:20,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:21:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:20,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:21:20,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:21:20,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:20,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538713524] [2024-11-19 06:21:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538713524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:20,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:21:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560092095] [2024-11-19 06:21:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:20,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:21:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:21:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:21:20,440 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:21:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:21,046 INFO L93 Difference]: Finished difference Result 345 states and 458 transitions. [2024-11-19 06:21:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:21:21,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-19 06:21:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:21,049 INFO L225 Difference]: With dead ends: 345 [2024-11-19 06:21:21,049 INFO L226 Difference]: Without dead ends: 345 [2024-11-19 06:21:21,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:21:21,050 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 158 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:21,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 522 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:21:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-19 06:21:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 313. [2024-11-19 06:21:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 306 states have internal predecessors, (389), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:21:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 417 transitions. [2024-11-19 06:21:21,066 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 417 transitions. Word has length 13 [2024-11-19 06:21:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:21,066 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 417 transitions. [2024-11-19 06:21:21,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:21:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 417 transitions. [2024-11-19 06:21:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:21:21,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:21,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:21,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:21:21,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:21,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1433712094, now seen corresponding path program 1 times [2024-11-19 06:21:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567397604] [2024-11-19 06:21:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:21,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:21,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:21,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:21,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:21:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:21,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:21:21,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:21,503 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:21:21,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:21:21,505 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:21:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 06:21:21,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:21:21,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 06:21:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:21:21,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:21,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567397604] [2024-11-19 06:21:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567397604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180346834] [2024-11-19 06:21:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:21,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:21,592 INFO L87 Difference]: Start difference. First operand 313 states and 417 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:21:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:22,238 INFO L93 Difference]: Finished difference Result 482 states and 651 transitions. [2024-11-19 06:21:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:21:22,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 06:21:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:22,241 INFO L225 Difference]: With dead ends: 482 [2024-11-19 06:21:22,242 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 06:21:22,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:21:22,243 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 241 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 768 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.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:22,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 768 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:21:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 06:21:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 312. [2024-11-19 06:21:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 293 states have (on average 1.3208191126279865) internal successors, (387), 305 states have internal predecessors, (387), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:21:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 415 transitions. [2024-11-19 06:21:22,262 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 415 transitions. Word has length 13 [2024-11-19 06:21:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 415 transitions. [2024-11-19 06:21:22,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:21:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2024-11-19 06:21:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 06:21:22,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:22,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:22,282 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-11-19 06:21:22,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:22,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:22,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash -9383057, now seen corresponding path program 1 times [2024-11-19 06:21:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:22,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389136876] [2024-11-19 06:21:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:22,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:22,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:22,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:22,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:21:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:22,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:21:22,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:21:22,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:22,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389136876] [2024-11-19 06:21:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389136876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:22,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050471831] [2024-11-19 06:21:22,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:22,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:22,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:22,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:22,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:22,873 INFO L87 Difference]: Start difference. First operand 312 states and 415 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:22,993 INFO L93 Difference]: Finished difference Result 318 states and 405 transitions. [2024-11-19 06:21:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:21:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 84 [2024-11-19 06:21:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:22,994 INFO L225 Difference]: With dead ends: 318 [2024-11-19 06:21:22,995 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 06:21:22,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:21:22,995 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:22,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 731 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:21:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 06:21:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-19 06:21:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 311 states have internal predecessors, (377), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:21:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2024-11-19 06:21:23,005 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 84 [2024-11-19 06:21:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:23,005 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2024-11-19 06:21:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2024-11-19 06:21:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 06:21:23,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:23,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:23,018 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-11-19 06:21:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:23,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -26194053, now seen corresponding path program 1 times [2024-11-19 06:21:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:23,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091807968] [2024-11-19 06:21:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:23,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:23,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:23,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:21:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:23,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:21:23,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:21:23,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:23,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091807968] [2024-11-19 06:21:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091807968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:23,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921832395] [2024-11-19 06:21:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:23,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:23,647 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:21:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:23,677 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2024-11-19 06:21:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:21:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (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 84 [2024-11-19 06:21:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:23,679 INFO L225 Difference]: With dead ends: 321 [2024-11-19 06:21:23,679 INFO L226 Difference]: Without dead ends: 321 [2024-11-19 06:21:23,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:23,680 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:23,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:21:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-19 06:21:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-19 06:21:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 301 states have (on average 1.2624584717607974) internal successors, (380), 314 states have internal predecessors, (380), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 06:21:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 409 transitions. [2024-11-19 06:21:23,688 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 409 transitions. Word has length 84 [2024-11-19 06:21:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:23,688 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 409 transitions. [2024-11-19 06:21:23,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:21:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2024-11-19 06:21:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 06:21:23,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:23,690 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:23,703 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-11-19 06:21:23,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:23,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:23,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1781255303, now seen corresponding path program 1 times [2024-11-19 06:21:23,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:23,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74527258] [2024-11-19 06:21:23,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:23,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:23,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:23,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:21:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:24,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:21:24,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:21:24,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:21:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:21:24,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74527258] [2024-11-19 06:21:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74527258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:21:24,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:21:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:21:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632386848] [2024-11-19 06:21:24,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:21:24,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:21:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:24,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:21:24,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:21:24,479 INFO L87 Difference]: Start difference. First operand 321 states and 409 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:24,694 INFO L93 Difference]: Finished difference Result 332 states and 425 transitions. [2024-11-19 06:21:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:21:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (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 86 [2024-11-19 06:21:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:24,696 INFO L225 Difference]: With dead ends: 332 [2024-11-19 06:21:24,696 INFO L226 Difference]: Without dead ends: 332 [2024-11-19 06:21:24,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:21:24,697 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 5 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:24,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1058 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:21:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-19 06:21:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2024-11-19 06:21:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 322 states have internal predecessors, (394), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 06:21:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 423 transitions. [2024-11-19 06:21:24,703 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 423 transitions. Word has length 86 [2024-11-19 06:21:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:24,704 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 423 transitions. [2024-11-19 06:21:24,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 423 transitions. [2024-11-19 06:21:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 06:21:24,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:24,706 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:24,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:21:24,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:24,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:24,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash -289991013, now seen corresponding path program 2 times [2024-11-19 06:21:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:24,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279191825] [2024-11-19 06:21:24,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:21:24,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:24,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:24,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:24,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:21:25,139 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:21:25,139 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:21:25,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:21:25,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 06:21:25,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:25,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:25,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279191825] [2024-11-19 06:21:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279191825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:25,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165926168] [2024-11-19 06:21:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:25,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:25,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:25,192 INFO L87 Difference]: Start difference. First operand 330 states and 423 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:29,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:21:33,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:21:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:37,374 INFO L93 Difference]: Finished difference Result 473 states and 618 transitions. [2024-11-19 06:21:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:21:37,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 90 [2024-11-19 06:21:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:37,377 INFO L225 Difference]: With dead ends: 473 [2024-11-19 06:21:37,377 INFO L226 Difference]: Without dead ends: 473 [2024-11-19 06:21:37,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:21:37,378 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 575 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:37,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 460 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-11-19 06:21:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-19 06:21:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 448. [2024-11-19 06:21:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 439 states have internal predecessors, (542), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 584 transitions. [2024-11-19 06:21:37,394 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 584 transitions. Word has length 90 [2024-11-19 06:21:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 584 transitions. [2024-11-19 06:21:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 584 transitions. [2024-11-19 06:21:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 06:21:37,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:37,398 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:37,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:21:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:37,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1120293607, now seen corresponding path program 1 times [2024-11-19 06:21:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949267665] [2024-11-19 06:21:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:37,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:37,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:37,605 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:37,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:21:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:38,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:21:38,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:21:38,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:21:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:21:38,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:38,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949267665] [2024-11-19 06:21:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949267665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:21:38,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:21:38,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:21:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142279759] [2024-11-19 06:21:38,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:21:38,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:21:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:38,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:21:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:21:38,394 INFO L87 Difference]: Start difference. First operand 448 states and 584 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:39,163 INFO L93 Difference]: Finished difference Result 463 states and 607 transitions. [2024-11-19 06:21:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:21:39,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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 100 [2024-11-19 06:21:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:39,167 INFO L225 Difference]: With dead ends: 463 [2024-11-19 06:21:39,167 INFO L226 Difference]: Without dead ends: 459 [2024-11-19 06:21:39,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:21:39,168 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 7 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:39,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2111 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:21:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-19 06:21:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-11-19 06:21:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 430 states have (on average 1.2883720930232558) internal successors, (554), 448 states have internal predecessors, (554), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 596 transitions. [2024-11-19 06:21:39,177 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 596 transitions. Word has length 100 [2024-11-19 06:21:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:39,177 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 596 transitions. [2024-11-19 06:21:39,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 596 transitions. [2024-11-19 06:21:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 06:21:39,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:39,179 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:39,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 06:21:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:39,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1271294094, now seen corresponding path program 2 times [2024-11-19 06:21:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:39,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57990451] [2024-11-19 06:21:39,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:21:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:39,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:39,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:21:39,856 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:21:39,856 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:21:39,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:21:39,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:39,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:21:39,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:21:39,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:21:39,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 06:21:40,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:21:40,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 06:21:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-19 06:21:40,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:40,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:40,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57990451] [2024-11-19 06:21:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57990451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189578765] [2024-11-19 06:21:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:40,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:40,046 INFO L87 Difference]: Start difference. First operand 457 states and 596 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:40,854 INFO L93 Difference]: Finished difference Result 668 states and 891 transitions. [2024-11-19 06:21:40,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:21:40,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 109 [2024-11-19 06:21:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:40,862 INFO L225 Difference]: With dead ends: 668 [2024-11-19 06:21:40,862 INFO L226 Difference]: Without dead ends: 668 [2024-11-19 06:21:40,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:21:40,863 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 187 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:40,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 743 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:21:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-19 06:21:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 461. [2024-11-19 06:21:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 434 states have (on average 1.2857142857142858) internal successors, (558), 452 states have internal predecessors, (558), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 600 transitions. [2024-11-19 06:21:40,888 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 600 transitions. Word has length 109 [2024-11-19 06:21:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:40,889 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 600 transitions. [2024-11-19 06:21:40,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 600 transitions. [2024-11-19 06:21:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 06:21:40,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:40,890 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:40,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:21:41,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:41,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:41,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2073201234, now seen corresponding path program 1 times [2024-11-19 06:21:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:41,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695274988] [2024-11-19 06:21:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:41,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:41,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:41,101 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:41,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:21:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:41,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:21:41,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:21:41,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:21:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:21:42,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695274988] [2024-11-19 06:21:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695274988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:21:42,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:21:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:21:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833971549] [2024-11-19 06:21:42,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:21:42,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:21:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:21:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:21:42,863 INFO L87 Difference]: Start difference. First operand 461 states and 600 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:45,525 INFO L93 Difference]: Finished difference Result 485 states and 641 transitions. [2024-11-19 06:21:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:21:45,527 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 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 142 [2024-11-19 06:21:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:45,529 INFO L225 Difference]: With dead ends: 485 [2024-11-19 06:21:45,529 INFO L226 Difference]: Without dead ends: 481 [2024-11-19 06:21:45,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:21:45,532 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 13 mSDsluCounter, 4212 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:45,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4478 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:21:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-19 06:21:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2024-11-19 06:21:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 452 states have (on average 1.2876106194690264) internal successors, (582), 470 states have internal predecessors, (582), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 624 transitions. [2024-11-19 06:21:45,544 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 624 transitions. Word has length 142 [2024-11-19 06:21:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:45,545 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 624 transitions. [2024-11-19 06:21:45,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 624 transitions. [2024-11-19 06:21:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 06:21:45,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:45,548 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:45,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:21:45,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:45,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:45,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1620799566, now seen corresponding path program 2 times [2024-11-19 06:21:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:45,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661349655] [2024-11-19 06:21:45,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:21:45,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:45,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:45,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:45,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:21:46,093 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:21:46,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:21:46,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:21:46,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-19 06:21:46,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:46,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661349655] [2024-11-19 06:21:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661349655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:21:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605386537] [2024-11-19 06:21:46,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:46,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:21:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:21:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:21:46,146 INFO L87 Difference]: Start difference. First operand 479 states and 624 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:46,283 INFO L93 Difference]: Finished difference Result 539 states and 684 transitions. [2024-11-19 06:21:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:21:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 160 [2024-11-19 06:21:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:46,286 INFO L225 Difference]: With dead ends: 539 [2024-11-19 06:21:46,286 INFO L226 Difference]: Without dead ends: 539 [2024-11-19 06:21:46,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:21:46,286 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:46,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 483 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:21:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-19 06:21:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-19 06:21:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 512 states have (on average 1.25390625) internal successors, (642), 530 states have internal predecessors, (642), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 684 transitions. [2024-11-19 06:21:46,300 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 684 transitions. Word has length 160 [2024-11-19 06:21:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:46,301 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 684 transitions. [2024-11-19 06:21:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 684 transitions. [2024-11-19 06:21:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-19 06:21:46,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:46,304 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:46,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:21:46,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:46,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:46,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -457426762, now seen corresponding path program 1 times [2024-11-19 06:21:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821362987] [2024-11-19 06:21:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:46,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:46,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:46,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:21:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:47,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:21:47,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 06:21:47,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:21:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 06:21:50,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821362987] [2024-11-19 06:21:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821362987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:21:50,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:21:50,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:21:50,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682013284] [2024-11-19 06:21:50,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:21:50,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:21:50,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:21:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:21:50,047 INFO L87 Difference]: Start difference. First operand 539 states and 684 transitions. Second operand has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:58,046 INFO L93 Difference]: Finished difference Result 579 states and 757 transitions. [2024-11-19 06:21:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:21:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 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 160 [2024-11-19 06:21:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:58,049 INFO L225 Difference]: With dead ends: 579 [2024-11-19 06:21:58,050 INFO L226 Difference]: Without dead ends: 575 [2024-11-19 06:21:58,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:21:58,053 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 25 mSDsluCounter, 6597 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6863 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:58,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6863 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 06:21:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-19 06:21:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2024-11-19 06:21:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 546 states have (on average 1.26007326007326) internal successors, (688), 564 states have internal predecessors, (688), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 730 transitions. [2024-11-19 06:21:58,076 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 730 transitions. Word has length 160 [2024-11-19 06:21:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 730 transitions. [2024-11-19 06:21:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:21:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 730 transitions. [2024-11-19 06:21:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 06:21:58,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:58,078 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:58,097 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 (13)] Ended with exit code 0 [2024-11-19 06:21:58,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:58,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:58,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash -282865066, now seen corresponding path program 2 times [2024-11-19 06:21:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799105130] [2024-11-19 06:21:58,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:21:58,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:58,283 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:58,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:21:58,709 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:21:58,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:21:58,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:21:58,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2351 trivial. 0 not checked. [2024-11-19 06:21:58,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:58,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:58,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799105130] [2024-11-19 06:21:58,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799105130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:58,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:58,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:58,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050554839] [2024-11-19 06:21:58,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:58,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:58,739 INFO L87 Difference]: Start difference. First operand 573 states and 730 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:58,830 INFO L93 Difference]: Finished difference Result 522 states and 646 transitions. [2024-11-19 06:21:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:21:58,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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 194 [2024-11-19 06:21:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:58,834 INFO L225 Difference]: With dead ends: 522 [2024-11-19 06:21:58,834 INFO L226 Difference]: Without dead ends: 522 [2024-11-19 06:21:58,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:21:58,835 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 32 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:21:58,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 694 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:21:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-19 06:21:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-11-19 06:21:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 495 states have (on average 1.2202020202020203) internal successors, (604), 513 states have internal predecessors, (604), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:21:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 646 transitions. [2024-11-19 06:21:58,847 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 646 transitions. Word has length 194 [2024-11-19 06:21:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:58,849 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 646 transitions. [2024-11-19 06:21:58,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:21:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 646 transitions. [2024-11-19 06:21:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 06:21:58,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:58,850 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:58,855 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 (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:21:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:59,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:59,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1741071112, now seen corresponding path program 1 times [2024-11-19 06:21:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247872194] [2024-11-19 06:21:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:59,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:21:59,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:59,054 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:21:59,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:22:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:00,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:22:00,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:22:00,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:22:02,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247872194] [2024-11-19 06:22:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247872194] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:02,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:22:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004360011] [2024-11-19 06:22:02,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:22:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:02,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:22:02,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:22:02,774 INFO L87 Difference]: Start difference. First operand 522 states and 646 transitions. Second operand has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:22:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:09,660 INFO L93 Difference]: Finished difference Result 551 states and 702 transitions. [2024-11-19 06:22:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:22:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 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 194 [2024-11-19 06:22:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:09,663 INFO L225 Difference]: With dead ends: 551 [2024-11-19 06:22:09,663 INFO L226 Difference]: Without dead ends: 551 [2024-11-19 06:22:09,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:22:09,665 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 27 mSDsluCounter, 6553 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6807 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:09,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6807 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 06:22:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-19 06:22:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 547. [2024-11-19 06:22:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 520 states have (on average 1.2576923076923077) internal successors, (654), 538 states have internal predecessors, (654), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-19 06:22:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 696 transitions. [2024-11-19 06:22:09,676 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 696 transitions. Word has length 194 [2024-11-19 06:22:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:09,676 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 696 transitions. [2024-11-19 06:22:09,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:22:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 696 transitions. [2024-11-19 06:22:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-19 06:22:09,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:09,678 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:09,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:22:09,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:22:09,883 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:09,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -18123217, now seen corresponding path program 2 times [2024-11-19 06:22:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:09,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860339709] [2024-11-19 06:22:09,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:22:09,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:22:09,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:09,887 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:22:09,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:22:11,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:22:11,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:22:11,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:22:11,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:22:13,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:22:19,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860339709] [2024-11-19 06:22:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860339709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:19,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:19,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:22:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673181487] [2024-11-19 06:22:19,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:22:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:22:19,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:22:19,549 INFO L87 Difference]: Start difference. First operand 547 states and 696 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)