./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.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_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:21:41,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:21:41,588 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:41,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:21:41,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:21:41,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:21:41,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:21:41,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:21:41,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:21:41,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:21:41,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:21:41,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:21:41,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:21:41,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:21:41,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:21:41,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:21:41,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:21:41,633 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:21:41,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:21:41,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:21:41,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:21:41,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:21:41,635 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:21:41,635 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:21:41,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:21:41,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:21:41,636 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:21:41,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:21:41,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:21:41,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:21:41,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:21:41,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:21:41,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:21:41,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:21:41,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:21:41,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:21:41,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:21:41,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:21:41,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:21:41,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:21:41,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:21:41,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:21:41,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:21:41,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:21:41,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:21:41,641 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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2024-11-19 06:21:41,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:21:41,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:21:41,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:21:41,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:21:41,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:21:41,916 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_test6-1.i [2024-11-19 06:21:43,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:21:43,716 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:21:43,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2024-11-19 06:21:43,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00647392d/64794e57ab1742a1924a872a0201474b/FLAG75eb46b19 [2024-11-19 06:21:43,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00647392d/64794e57ab1742a1924a872a0201474b [2024-11-19 06:21:43,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:21:43,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:21:43,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:43,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:21:43,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:21:43,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:43" (1/1) ... [2024-11-19 06:21:43,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777036da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:43, skipping insertion in model container [2024-11-19 06:21:43,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:43" (1/1) ... [2024-11-19 06:21:43,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:21:44,367 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:44,400 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:44,403 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:44,406 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:44,411 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:44,447 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:44,450 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:44,453 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:44,453 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:44,459 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:44,460 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:44,461 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:44,461 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:44,469 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:44,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:44,496 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:44,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1459d43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:44, skipping insertion in model container [2024-11-19 06:21:44,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:44,497 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:21:44,499 INFO L158 Benchmark]: Toolchain (without parser) took 729.16ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 107.0MB in the end (delta: -22.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 06:21:44,499 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory was 134.2MB in the beginning and 134.0MB in the end (delta: 194.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:21:44,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.06ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 107.0MB in the end (delta: -22.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 06:21:44,501 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.20ms. Allocated memory is still 159.4MB. Free memory was 134.2MB in the beginning and 134.0MB in the end (delta: 194.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.06ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 107.0MB in the end (delta: -22.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:21:46,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:21:46,574 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:46,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:21:46,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:21:46,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:21:46,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:21:46,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:21:46,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:21:46,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:21:46,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:21:46,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:21:46,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:21:46,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:21:46,620 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:21:46,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:21:46,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:21:46,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:21:46,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:21:46,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:21:46,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:21:46,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:21:46,626 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:21:46,626 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:21:46,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:21:46,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:21:46,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:21:46,627 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:21:46,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:21:46,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:21:46,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:21:46,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:21:46,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:21:46,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:21:46,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:21:46,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:21:46,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:21:46,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:21:46,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:21:46,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:21:46,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:21:46,632 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:21:46,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:21:46,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:21:46,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:21:46,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:21:46,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:21:46,634 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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2024-11-19 06:21:46,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:21:46,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:21:46,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:21:46,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:21:46,997 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:21:46,999 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_test6-1.i [2024-11-19 06:21:48,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:21:48,837 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:21:48,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2024-11-19 06:21:48,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b23b5398/9d74599ab61e48279633feab3cd02d2a/FLAG6b202567f [2024-11-19 06:21:48,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b23b5398/9d74599ab61e48279633feab3cd02d2a [2024-11-19 06:21:48,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:21:48,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:21:48,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:48,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:21:48,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:21:48,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:48" (1/1) ... [2024-11-19 06:21:48,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8c93e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:48, skipping insertion in model container [2024-11-19 06:21:48,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:21:48" (1/1) ... [2024-11-19 06:21:48,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:21:49,472 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:49,499 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:49,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:21:49,509 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:49,518 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:49,567 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:49,570 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:49,572 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:49,573 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:49,577 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:49,579 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:49,582 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:49,583 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:49,588 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:49,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:49,612 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:21:49,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:21:49,675 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:49,695 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:49,696 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:49,698 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:49,702 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:49,718 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:49,722 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:49,728 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:49,728 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:49,731 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:49,732 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:49,733 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:49,734 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:49,739 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:49,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:49,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:21:49,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:21:49,944 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:21:49,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:49 WrapperNode [2024-11-19 06:21:49,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:21:49,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:21:49,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:21:49,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:21:49,953 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:49" (1/1) ... [2024-11-19 06:21:49,990 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:49" (1/1) ... [2024-11-19 06:21:50,053 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1071 [2024-11-19 06:21:50,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:21:50,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:21:50,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:21:50,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:21:50,068 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:49" (1/1) ... [2024-11-19 06:21:50,069 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:49" (1/1) ... [2024-11-19 06:21:50,083 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:49" (1/1) ... [2024-11-19 06:21:50,177 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2024-11-19 06:21:50,178 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:49" (1/1) ... [2024-11-19 06:21:50,178 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:49" (1/1) ... [2024-11-19 06:21:50,249 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:49" (1/1) ... [2024-11-19 06:21:50,260 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:49" (1/1) ... [2024-11-19 06:21:50,266 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:49" (1/1) ... [2024-11-19 06:21:50,271 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:49" (1/1) ... [2024-11-19 06:21:50,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:21:50,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:21:50,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:21:50,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:21:50,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:49" (1/1) ... [2024-11-19 06:21:50,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:21:50,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:21:50,331 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:50,335 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:50,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:21:50,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:21:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:21:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:21:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:21:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 06:21:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:21:50,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 06:21:50,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:21:50,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 06:21:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 06:21:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 06:21:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 06:21:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 06:21:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-19 06:21:50,386 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-19 06:21:50,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:21:50,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-19 06:21:50,387 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 06:21:50,387 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-19 06:21:50,388 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-19 06:21:50,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:21:50,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:21:50,675 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:21:50,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:21:57,406 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-19 06:21:57,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:21:57,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:21:57,429 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 06:21:57,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:21:57 BoogieIcfgContainer [2024-11-19 06:21:57,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:21:57,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:21:57,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:21:57,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:21:57,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:21:48" (1/3) ... [2024-11-19 06:21:57,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5276f783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:21:57, skipping insertion in model container [2024-11-19 06:21:57,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:21:49" (2/3) ... [2024-11-19 06:21:57,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5276f783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:21:57, skipping insertion in model container [2024-11-19 06:21:57,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:21:57" (3/3) ... [2024-11-19 06:21:57,441 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2024-11-19 06:21:57,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:21:57,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:21:57,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:21:57,532 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;@7fcad771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:21:57,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:21:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 214 states have internal predecessors, (336), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 06:21:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:21:57,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:57,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:57,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1647619846, now seen corresponding path program 1 times [2024-11-19 06:21:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750297059] [2024-11-19 06:21:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:57,572 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:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:57,576 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:57,579 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:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:57,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:21:57,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:57,825 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:57,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:57,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750297059] [2024-11-19 06:21:57,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750297059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:21:57,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763809251] [2024-11-19 06:21:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:57,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:21:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:21:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:21:57,866 INFO L87 Difference]: Start difference. First operand has 234 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 214 states have internal predecessors, (336), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:21:57,910 INFO L93 Difference]: Finished difference Result 229 states and 294 transitions. [2024-11-19 06:21:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:21:57,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-11-19 06:21:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:21:57,922 INFO L225 Difference]: With dead ends: 229 [2024-11-19 06:21:57,922 INFO L226 Difference]: Without dead ends: 227 [2024-11-19 06:21:57,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:57,930 INFO L432 NwaCegarLoop]: 294 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, 294 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:57,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 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:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-19 06:21:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-19 06:21:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 204 states have (on average 1.2843137254901962) internal successors, (262), 209 states have internal predecessors, (262), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:21:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2024-11-19 06:21:58,051 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 10 [2024-11-19 06:21:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:21:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2024-11-19 06:21:58,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2024-11-19 06:21:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:21:58,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:21:58,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:21:58,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:21:58,259 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:58,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:21:58,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:21:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash -617467811, now seen corresponding path program 1 times [2024-11-19 06:21:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:21:58,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005120067] [2024-11-19 06:21:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:21:58,262 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,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:21:58,264 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:58,265 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:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:21:58,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:21:58,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:21:58,582 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:58,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:21:58,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:21:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005120067] [2024-11-19 06:21:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005120067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:21:58,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:21:58,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:21:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489281583] [2024-11-19 06:21:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:21:58,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:21:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:21:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:21:58,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:21:58,589 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:00,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:22:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:02,371 INFO L93 Difference]: Finished difference Result 343 states and 444 transitions. [2024-11-19 06:22:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:22:02,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 06:22:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:02,375 INFO L225 Difference]: With dead ends: 343 [2024-11-19 06:22:02,375 INFO L226 Difference]: Without dead ends: 343 [2024-11-19 06:22:02,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:22:02,379 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 139 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:02,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 791 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-19 06:22:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-19 06:22:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2024-11-19 06:22:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 316 states have (on average 1.2943037974683544) internal successors, (409), 321 states have internal predecessors, (409), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:22:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 439 transitions. [2024-11-19 06:22:02,408 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 439 transitions. Word has length 12 [2024-11-19 06:22:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:02,408 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 439 transitions. [2024-11-19 06:22:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 439 transitions. [2024-11-19 06:22:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:22:02,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:02,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:02,420 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:22:02,614 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:22:02,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -559454960, now seen corresponding path program 1 times [2024-11-19 06:22:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51485037] [2024-11-19 06:22:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:22:02,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:02,620 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:22:02,621 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:22:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:02,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:22:02,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:02,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:22:02,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:22:02,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:22:02,863 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:22:02,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:22:02,928 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:22:02,949 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:22:02,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:02,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51485037] [2024-11-19 06:22:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51485037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:02,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:22:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610560902] [2024-11-19 06:22:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:02,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:22:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:22:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:22:02,962 INFO L87 Difference]: Start difference. First operand 339 states and 439 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:03,734 INFO L93 Difference]: Finished difference Result 519 states and 679 transitions. [2024-11-19 06:22:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:22:03,735 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:22:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:03,738 INFO L225 Difference]: With dead ends: 519 [2024-11-19 06:22:03,738 INFO L226 Difference]: Without dead ends: 519 [2024-11-19 06:22:03,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:22:03,739 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 230 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:03,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 824 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:22:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-19 06:22:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 338. [2024-11-19 06:22:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 315 states have (on average 1.2920634920634921) internal successors, (407), 320 states have internal predecessors, (407), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:22:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 437 transitions. [2024-11-19 06:22:03,759 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 437 transitions. Word has length 15 [2024-11-19 06:22:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:03,759 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 437 transitions. [2024-11-19 06:22:03,759 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 437 transitions. [2024-11-19 06:22:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:22:03,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:03,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:03,767 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:22:03,961 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:22:03,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1940751512, now seen corresponding path program 1 times [2024-11-19 06:22:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614869769] [2024-11-19 06:22:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:03,964 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:03,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:03,965 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:22:03,966 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:22:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:04,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:22:04,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:04,340 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:22:04,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:04,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614869769] [2024-11-19 06:22:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614869769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:04,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:22:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293252996] [2024-11-19 06:22:04,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:04,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:22:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:04,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:22:04,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:22:04,347 INFO L87 Difference]: Start difference. First operand 338 states and 437 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:04,463 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2024-11-19 06:22:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:22:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-19 06:22:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:04,465 INFO L225 Difference]: With dead ends: 344 [2024-11-19 06:22:04,465 INFO L226 Difference]: Without dead ends: 344 [2024-11-19 06:22:04,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:22:04,466 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 30 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 767 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:22:04,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 767 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:22:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-19 06:22:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-19 06:22:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 321 states have (on average 1.236760124610592) internal successors, (397), 326 states have internal predecessors, (397), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:22:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2024-11-19 06:22:04,486 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 427 transitions. Word has length 50 [2024-11-19 06:22:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:04,486 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 427 transitions. [2024-11-19 06:22:04,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 427 transitions. [2024-11-19 06:22:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:22:04,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:04,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:04,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:22:04,691 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:22:04,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:04,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1486167460, now seen corresponding path program 1 times [2024-11-19 06:22:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431527623] [2024-11-19 06:22:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:04,693 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:04,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:04,696 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:22:04,697 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:22:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:04,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:22:04,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:05,027 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:22:05,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:05,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:05,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431527623] [2024-11-19 06:22:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431527623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:05,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:22:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495667218] [2024-11-19 06:22:05,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:05,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:22:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:22:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:22:05,031 INFO L87 Difference]: Start difference. First operand 344 states and 427 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:05,130 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2024-11-19 06:22:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:22:05,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-19 06:22:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:05,132 INFO L225 Difference]: With dead ends: 354 [2024-11-19 06:22:05,132 INFO L226 Difference]: Without dead ends: 354 [2024-11-19 06:22:05,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:22:05,134 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 9 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:05,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1371 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:22:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-19 06:22:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-19 06:22:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.2347560975609757) internal successors, (405), 334 states have internal predecessors, (405), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 06:22:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2024-11-19 06:22:05,153 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 50 [2024-11-19 06:22:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:05,154 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2024-11-19 06:22:05,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:22:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2024-11-19 06:22:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 06:22:05,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:05,158 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:05,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:22:05,359 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:22:05,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1102378676, now seen corresponding path program 1 times [2024-11-19 06:22:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735142330] [2024-11-19 06:22:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:05,361 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:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:05,364 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:22:05,365 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:22:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:05,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:22:05,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:22:05,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:05,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735142330] [2024-11-19 06:22:05,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735142330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:22:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647362944] [2024-11-19 06:22:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:05,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:22:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:22:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:22:05,908 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:22:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:06,080 INFO L93 Difference]: Finished difference Result 362 states and 447 transitions. [2024-11-19 06:22:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:22:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-19 06:22:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:06,083 INFO L225 Difference]: With dead ends: 362 [2024-11-19 06:22:06,084 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 06:22:06,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:22:06,085 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 20 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:06,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 990 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:22:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 06:22:06,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2024-11-19 06:22:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 330 states have (on average 1.2333333333333334) internal successors, (407), 337 states have internal predecessors, (407), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-19 06:22:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 442 transitions. [2024-11-19 06:22:06,100 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 442 transitions. Word has length 65 [2024-11-19 06:22:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 442 transitions. [2024-11-19 06:22:06,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:22:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 442 transitions. [2024-11-19 06:22:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 06:22:06,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:06,103 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] [2024-11-19 06:22:06,114 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:22:06,303 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:22:06,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:06,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1344249161, now seen corresponding path program 1 times [2024-11-19 06:22:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571786365] [2024-11-19 06:22:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:06,305 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:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:06,306 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:22:06,307 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:22:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:06,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:22:06,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:22:06,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:06,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571786365] [2024-11-19 06:22:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571786365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:22:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582460580] [2024-11-19 06:22:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:06,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:22:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:22:06,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:22:06,776 INFO L87 Difference]: Start difference. First operand 358 states and 442 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:22:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:06,820 INFO L93 Difference]: Finished difference Result 362 states and 447 transitions. [2024-11-19 06:22:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:22:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-11-19 06:22:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:06,824 INFO L225 Difference]: With dead ends: 362 [2024-11-19 06:22:06,824 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 06:22:06,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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:22:06,825 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:06,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:22:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 06:22:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-19 06:22:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 333 states have (on average 1.2342342342342343) internal successors, (411), 341 states have internal predecessors, (411), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 06:22:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 447 transitions. [2024-11-19 06:22:06,836 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 447 transitions. Word has length 70 [2024-11-19 06:22:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:06,836 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 447 transitions. [2024-11-19 06:22:06,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:22:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 447 transitions. [2024-11-19 06:22:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 06:22:06,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:06,838 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] [2024-11-19 06:22:06,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:22:07,041 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:22:07,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:07,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:07,042 INFO L85 PathProgramCache]: Analyzing trace with hash 198026384, now seen corresponding path program 1 times [2024-11-19 06:22:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736004154] [2024-11-19 06:22:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:07,043 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:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:07,044 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:22:07,045 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:22:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:07,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:22:07,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:22:07,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:22:07,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736004154] [2024-11-19 06:22:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736004154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:07,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:22:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245108529] [2024-11-19 06:22:07,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:07,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:22:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:22:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:22:07,667 INFO L87 Difference]: Start difference. First operand 362 states and 447 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:22:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:07,908 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2024-11-19 06:22:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:22:07,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2024-11-19 06:22:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:07,912 INFO L225 Difference]: With dead ends: 375 [2024-11-19 06:22:07,912 INFO L226 Difference]: Without dead ends: 375 [2024-11-19 06:22:07,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 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:22:07,913 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 4 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:07,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1642 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:22:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-19 06:22:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2024-11-19 06:22:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 342 states have (on average 1.2456140350877194) internal successors, (426), 350 states have internal predecessors, (426), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 06:22:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2024-11-19 06:22:07,924 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 71 [2024-11-19 06:22:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2024-11-19 06:22:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:22:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2024-11-19 06:22:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 06:22:07,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:07,926 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-19 06:22:07,940 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:22:08,126 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:22:08,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:08,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash -502361865, now seen corresponding path program 2 times [2024-11-19 06:22:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:08,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3461313] [2024-11-19 06:22:08,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:22:08,129 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:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:08,130 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:22:08,131 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:22:08,719 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:22:08,719 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:22:08,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:22:08,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:22:08,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:22:09,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3461313] [2024-11-19 06:22:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3461313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:09,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 06:22:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210969383] [2024-11-19 06:22:09,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:09,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:22:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:09,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:22:09,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:22:09,209 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:22:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:10,838 INFO L93 Difference]: Finished difference Result 2726 states and 3450 transitions. [2024-11-19 06:22:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 06:22:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-19 06:22:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:10,850 INFO L225 Difference]: With dead ends: 2726 [2024-11-19 06:22:10,850 INFO L226 Difference]: Without dead ends: 2726 [2024-11-19 06:22:10,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:22:10,851 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 2331 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 5669 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:10,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 5669 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:22:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-19 06:22:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1887. [2024-11-19 06:22:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1793 states have (on average 1.2576687116564418) internal successors, (2255), 1807 states have internal predecessors, (2255), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-19 06:22:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2375 transitions. [2024-11-19 06:22:10,906 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2375 transitions. Word has length 74 [2024-11-19 06:22:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:10,906 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2375 transitions. [2024-11-19 06:22:10,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:22:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2375 transitions. [2024-11-19 06:22:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 06:22:10,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:10,908 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:10,921 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:22:11,108 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:22:11,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:11,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1616929423, now seen corresponding path program 1 times [2024-11-19 06:22:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:11,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827584685] [2024-11-19 06:22:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:11,110 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:11,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:11,111 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:22:11,112 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:22:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:11,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:22:11,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:22:11,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 06:22:12,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827584685] [2024-11-19 06:22:12,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827584685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:12,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:12,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:22:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283150826] [2024-11-19 06:22:12,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:12,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:22:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:22:12,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:22:12,037 INFO L87 Difference]: Start difference. First operand 1887 states and 2375 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:22:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:12,747 INFO L93 Difference]: Finished difference Result 1977 states and 2500 transitions. [2024-11-19 06:22:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:22:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2024-11-19 06:22:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:12,757 INFO L225 Difference]: With dead ends: 1977 [2024-11-19 06:22:12,757 INFO L226 Difference]: Without dead ends: 1947 [2024-11-19 06:22:12,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 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:22:12,759 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 7 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:12,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2732 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:22:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-19 06:22:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1932. [2024-11-19 06:22:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1838 states have (on average 1.2595212187159956) internal successors, (2315), 1852 states have internal predecessors, (2315), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-19 06:22:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2435 transitions. [2024-11-19 06:22:12,813 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2435 transitions. Word has length 110 [2024-11-19 06:22:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:12,813 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2435 transitions. [2024-11-19 06:22:12,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:22:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2435 transitions. [2024-11-19 06:22:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 06:22:12,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:12,816 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:22:12,832 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:22:13,016 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:22:13,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:13,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1059147878, now seen corresponding path program 2 times [2024-11-19 06:22:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779985105] [2024-11-19 06:22:13,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:22:13,020 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:13,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:13,023 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:22:13,024 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:22:13,380 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:22:13,380 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:22:13,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:22:13,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:13,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:22:13,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:22:13,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:22:13,403 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:22:13,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:22:13,448 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:22:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-19 06:22:13,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:13,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:13,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779985105] [2024-11-19 06:22:13,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779985105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:13,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:13,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:22:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444621972] [2024-11-19 06:22:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:13,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:22:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:13,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:22:13,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:22:13,464 INFO L87 Difference]: Start difference. First operand 1932 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:22:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:14,005 INFO L93 Difference]: Finished difference Result 2702 states and 3455 transitions. [2024-11-19 06:22:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:22:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-11-19 06:22:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:14,017 INFO L225 Difference]: With dead ends: 2702 [2024-11-19 06:22:14,017 INFO L226 Difference]: Without dead ends: 2702 [2024-11-19 06:22:14,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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:22:14,018 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 215 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:14,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 769 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:22:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-11-19 06:22:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1944. [2024-11-19 06:22:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1850 states have (on average 1.2578378378378379) internal successors, (2327), 1864 states have internal predecessors, (2327), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-19 06:22:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2447 transitions. [2024-11-19 06:22:14,096 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2447 transitions. Word has length 119 [2024-11-19 06:22:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:14,097 INFO L471 AbstractCegarLoop]: Abstraction has 1944 states and 2447 transitions. [2024-11-19 06:22:14,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:22:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2447 transitions. [2024-11-19 06:22:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 06:22:14,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:14,099 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 06:22:14,106 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 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:22:14,299 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:22:14,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1325047018, now seen corresponding path program 1 times [2024-11-19 06:22:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977651513] [2024-11-19 06:22:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:22:14,303 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:14,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:14,306 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:22:14,307 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:22:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:22:14,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:22:14,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:22:15,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-19 06:22:15,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:15,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977651513] [2024-11-19 06:22:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977651513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:15,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:15,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:22:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292826829] [2024-11-19 06:22:15,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:15,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:22:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:15,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:22:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:22:15,870 INFO L87 Difference]: Start difference. First operand 1944 states and 2447 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:22:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:18,485 INFO L93 Difference]: Finished difference Result 2079 states and 2662 transitions. [2024-11-19 06:22:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:22:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-19 06:22:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:18,493 INFO L225 Difference]: With dead ends: 2079 [2024-11-19 06:22:18,493 INFO L226 Difference]: Without dead ends: 2049 [2024-11-19 06:22:18,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:22:18,495 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 14 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:18,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3283 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:22:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-19 06:22:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2034. [2024-11-19 06:22:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1940 states have (on average 1.261340206185567) internal successors, (2447), 1954 states have internal predecessors, (2447), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-19 06:22:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2567 transitions. [2024-11-19 06:22:18,536 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2567 transitions. Word has length 126 [2024-11-19 06:22:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:18,537 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2567 transitions. [2024-11-19 06:22:18,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:22:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2567 transitions. [2024-11-19 06:22:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-19 06:22:18,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:18,539 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 06:22:18,557 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:22:18,739 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:22:18,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:18,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash -951160330, now seen corresponding path program 2 times [2024-11-19 06:22:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326912004] [2024-11-19 06:22:18,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:22:18,742 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:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:18,746 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:22:18,747 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:22:19,930 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:22:19,930 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:22:19,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:22:19,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-19 06:22:20,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:22:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 06:22:22,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326912004] [2024-11-19 06:22:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326912004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:22:22,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:22:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:22:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882420089] [2024-11-19 06:22:22,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:22:22,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:22:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:22:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:22:22,636 INFO L87 Difference]: Start difference. First operand 2034 states and 2567 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:22:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:22:34,982 INFO L93 Difference]: Finished difference Result 2249 states and 2942 transitions. [2024-11-19 06:22:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:22:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2024-11-19 06:22:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:22:34,992 INFO L225 Difference]: With dead ends: 2249 [2024-11-19 06:22:34,992 INFO L226 Difference]: Without dead ends: 2219 [2024-11-19 06:22:34,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:22:34,995 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 26 mSDsluCounter, 7366 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7643 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:22:34,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7643 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 06:22:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2024-11-19 06:22:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2204. [2024-11-19 06:22:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 2110 states have (on average 1.2687203791469195) internal successors, (2677), 2124 states have internal predecessors, (2677), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-19 06:22:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2797 transitions. [2024-11-19 06:22:35,048 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2797 transitions. Word has length 144 [2024-11-19 06:22:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:22:35,048 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 2797 transitions. [2024-11-19 06:22:35,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 06:22:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2797 transitions. [2024-11-19 06:22:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-19 06:22:35,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:22:35,050 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 06:22:35,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:22:35,250 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:22:35,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:22:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:22:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1179384982, now seen corresponding path program 3 times [2024-11-19 06:22:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:22:35,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174672173] [2024-11-19 06:22:35,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:22:35,253 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:35,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:22:35,256 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:22:35,258 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:36,482 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:22:36,482 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:22:36,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:22:36,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:22:36,536 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 44 treesize of output 53 [2024-11-19 06:22:36,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 277 [2024-11-19 06:22:36,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 181 [2024-11-19 06:22:36,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:22:36,969 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 181 treesize of output 85 [2024-11-19 06:22:37,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 457 treesize of output 337 [2024-11-19 06:22:37,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 217 [2024-11-19 06:22:37,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:22:37,642 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 217 treesize of output 97 [2024-11-19 06:22:38,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-19 06:22:38,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-19 06:22:38,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:22:38,659 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 68 treesize of output 20 [2024-11-19 06:22:39,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:22:39,113 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 214 treesize of output 106 [2024-11-19 06:22:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-19 06:22:39,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:22:39,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:22:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174672173] [2024-11-19 06:22:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174672173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:22:39,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:22:39,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 06:22:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885322786] [2024-11-19 06:22:39,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:22:39,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:22:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:22:39,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:22:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:22:39,291 INFO L87 Difference]: Start difference. First operand 2204 states and 2797 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:22:45,065 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:22:47,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:22:51,718 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:22:54,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:23:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:04,222 INFO L93 Difference]: Finished difference Result 2357 states and 3003 transitions. [2024-11-19 06:23:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:23:04,224 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 178 [2024-11-19 06:23:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:04,232 INFO L225 Difference]: With dead ends: 2357 [2024-11-19 06:23:04,232 INFO L226 Difference]: Without dead ends: 2357 [2024-11-19 06:23:04,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:23:04,233 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 36 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:04,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2374 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 551 Invalid, 2 Unknown, 0 Unchecked, 24.2s Time] [2024-11-19 06:23:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-11-19 06:23:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2257. [2024-11-19 06:23:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2154 states have (on average 1.267409470752089) internal successors, (2730), 2164 states have internal predecessors, (2730), 62 states have call successors, (62), 41 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-19 06:23:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2863 transitions. [2024-11-19 06:23:04,274 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2863 transitions. Word has length 178 [2024-11-19 06:23:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:04,274 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2863 transitions. [2024-11-19 06:23:04,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-19 06:23:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2863 transitions. [2024-11-19 06:23:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 06:23:04,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:04,276 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 06:23:04,295 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:23:04,477 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:23:04,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:04,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 389438833, now seen corresponding path program 4 times [2024-11-19 06:23:04,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:04,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325157719] [2024-11-19 06:23:04,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 06:23:04,480 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:23:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:04,483 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:23:04,484 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:23:06,368 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 06:23:06,368 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:23:06,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:23:06,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-19 06:23:06,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-19 06:23:06,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:06,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325157719] [2024-11-19 06:23:06,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325157719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:06,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:06,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:23:06,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119555974] [2024-11-19 06:23:06,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:06,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:23:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:23:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:23:06,838 INFO L87 Difference]: Start difference. First operand 2257 states and 2863 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 06:23:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:07,138 INFO L93 Difference]: Finished difference Result 2287 states and 2878 transitions. [2024-11-19 06:23:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:23:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 179 [2024-11-19 06:23:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:07,147 INFO L225 Difference]: With dead ends: 2287 [2024-11-19 06:23:07,148 INFO L226 Difference]: Without dead ends: 2257 [2024-11-19 06:23:07,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:23:07,150 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 6 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:07,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1644 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:23:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-19 06:23:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-19 06:23:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2154 states have (on average 1.2511606313834727) internal successors, (2695), 2164 states have internal predecessors, (2695), 62 states have call successors, (62), 41 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-19 06:23:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2828 transitions. [2024-11-19 06:23:07,191 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2828 transitions. Word has length 179 [2024-11-19 06:23:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:07,192 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 2828 transitions. [2024-11-19 06:23:07,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 06:23:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2828 transitions. [2024-11-19 06:23:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 06:23:07,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:07,194 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 06:23:07,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:23:07,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:07,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:07,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1581964118, now seen corresponding path program 5 times [2024-11-19 06:23:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:07,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086993740] [2024-11-19 06:23:07,396 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 06:23:07,397 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:23:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:07,398 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:07,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process