./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f 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_FNV_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:53:56,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:53:56,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:53:56,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:53:56,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:53:56,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:53:56,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:53:56,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:53:56,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:53:56,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:53:56,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:53:56,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:53:56,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:53:56,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:53:56,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:53:56,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:53:56,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:53:56,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:53:56,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:53:56,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:53:56,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:53:56,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:53:56,813 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:53:56,813 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:53:56,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:53:56,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:53:56,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:53:56,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:53:56,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:53:56,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:53:56,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:53:56,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:53:56,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:53:56,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:53:56,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:53:56,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:53:56,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:53:56,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:53:56,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:53:56,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:53:56,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:53:56,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:53:56,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:53:56,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:53:56,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:53:56,818 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-12 12:53:57,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:53:57,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:53:57,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:53:57,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:53:57,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:53:57,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-11-12 12:53:58,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:53:58,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:53:58,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-11-12 12:53:58,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbb411a8/f7758490a65243baa62f88f41ab2ffd4/FLAGdf5804150 [2024-11-12 12:53:58,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbb411a8/f7758490a65243baa62f88f41ab2ffd4 [2024-11-12 12:53:58,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:53:58,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:53:58,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:53:58,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:53:58,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:53:58,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:58" (1/1) ... [2024-11-12 12:53:58,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a965e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:58, skipping insertion in model container [2024-11-12 12:53:58,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:58" (1/1) ... [2024-11-12 12:53:58,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:53:59,242 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-12 12:53:59,274 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-12 12:53:59,281 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-12 12:53:59,283 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-12 12:53:59,288 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-12 12:53:59,336 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-12 12:53:59,343 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-12 12:53:59,345 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-12 12:53:59,361 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-12 12:53:59,380 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-12 12:53:59,407 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-12 12:53:59,408 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-12 12:53:59,409 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-12 12:53:59,410 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-12 12:53:59,417 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-12 12:53:59,422 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-12 12:53:59,422 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-12 12:53:59,423 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-12 12:53:59,423 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-12 12:53:59,426 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-12 12:53:59,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:53:59,442 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-12 12:53:59,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@acf977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:59, skipping insertion in model container [2024-11-12 12:53:59,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:53:59,443 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 12:53:59,445 INFO L158 Benchmark]: Toolchain (without parser) took 651.34ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 144.5MB in the end (delta: -34.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-12 12:53:59,445 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:53:59,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.33ms. Allocated memory is still 180.4MB. Free memory was 110.3MB in the beginning and 144.5MB in the end (delta: -34.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-12 12:53:59,450 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.17ms. Allocated memory is still 109.1MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.33ms. Allocated memory is still 180.4MB. Free memory was 110.3MB in the beginning and 144.5MB in the end (delta: -34.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_FNV_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:54:01,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:54:01,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-12 12:54:01,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:54:01,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:54:01,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:54:01,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:54:01,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:54:01,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:54:01,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:54:01,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:54:01,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:54:01,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:54:01,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:54:01,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:54:01,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:54:01,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:54:01,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:54:01,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:54:01,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:54:01,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:54:01,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:54:01,504 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:54:01,504 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:54:01,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:54:01,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:54:01,505 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:54:01,505 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 12:54:01,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:54:01,506 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 12:54:01,506 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:54:01,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:54:01,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:54:01,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:54:01,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:54:01,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:54:01,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:54:01,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:54:01,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:54:01,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:54:01,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:54:01,514 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 12:54:01,515 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 12:54:01,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:54:01,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:54:01,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:54:01,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:54:01,515 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-12 12:54:01,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:54:01,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:54:01,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:54:01,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:54:01,820 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:54:01,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-11-12 12:54:03,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:54:03,507 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:54:03,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-11-12 12:54:03,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5d843b1/5fac7780898244f1a37d78822806dd7a/FLAG82d506bda [2024-11-12 12:54:03,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5d843b1/5fac7780898244f1a37d78822806dd7a [2024-11-12 12:54:03,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:54:03,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:54:03,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:54:03,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:54:03,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:54:03,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:03" (1/1) ... [2024-11-12 12:54:03,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b05801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:03, skipping insertion in model container [2024-11-12 12:54:03,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:03" (1/1) ... [2024-11-12 12:54:03,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:54:04,273 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-12 12:54:04,307 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-12 12:54:04,312 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-12 12:54:04,315 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-12 12:54:04,327 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-12 12:54:04,363 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-12 12:54:04,365 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-12 12:54:04,371 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-12 12:54:04,374 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-12 12:54:04,388 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-12 12:54:04,393 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-12 12:54:04,394 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-12 12:54:04,398 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-12 12:54:04,402 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-12 12:54:04,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-12 12:54:04,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-12 12:54:04,407 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-12 12:54:04,407 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-12 12:54:04,408 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-12 12:54:04,410 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-12 12:54:04,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:54:04,435 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 12:54:04,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:54:04,455 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-12 12:54:04,462 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-12 12:54:04,463 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-12 12:54:04,465 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-12 12:54:04,467 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-12 12:54:04,478 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-12 12:54:04,479 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-12 12:54:04,481 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-12 12:54:04,483 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-12 12:54:04,488 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-12 12:54:04,488 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-12 12:54:04,489 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-12 12:54:04,490 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-12 12:54:04,491 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-12 12:54:04,491 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-12 12:54:04,493 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-12 12:54:04,494 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-12 12:54:04,494 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-12 12:54:04,494 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-12 12:54:04,496 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-12 12:54:04,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:54:04,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:54:04,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:54:04,654 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:54:04,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04 WrapperNode [2024-11-12 12:54:04,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:54:04,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:54:04,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:54:04,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:54:04,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,745 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1431 [2024-11-12 12:54:04,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:54:04,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:54:04,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:54:04,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:54:04,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,897 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-12 12:54:04,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:54:04,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:54:04,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:54:04,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:54:04,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (1/1) ... [2024-11-12 12:54:04,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:54:04,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:54:05,022 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-12 12:54:05,033 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-12 12:54:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 12:54:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 12:54:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 12:54:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 12:54:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 12:54:05,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 12:54:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 12:54:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 12:54:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:54:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:54:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:54:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:54:05,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:54:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:54:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:54:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 12:54:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 12:54:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 12:54:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 12:54:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:54:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:54:05,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:54:05,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:54:18,905 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2024-11-12 12:54:18,905 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:54:18,925 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:54:18,927 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-12 12:54:18,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:18 BoogieIcfgContainer [2024-11-12 12:54:18,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:54:18,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:54:18,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:54:18,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:54:18,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:54:03" (1/3) ... [2024-11-12 12:54:18,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cae05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:18, skipping insertion in model container [2024-11-12 12:54:18,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:04" (2/3) ... [2024-11-12 12:54:18,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cae05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:18, skipping insertion in model container [2024-11-12 12:54:18,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:18" (3/3) ... [2024-11-12 12:54:18,935 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-3.i [2024-11-12 12:54:18,950 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:54:18,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:54:19,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:54:19,016 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;@2a2de37f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:54:19,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:54:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 251 states, 241 states have (on average 1.6556016597510372) internal successors, (399), 243 states have internal predecessors, (399), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:54:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 12:54:19,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:54:19,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 12:54:19,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:54:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:54:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1419139, now seen corresponding path program 1 times [2024-11-12 12:54:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:54:19,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63002607] [2024-11-12 12:54:19,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:54:19,044 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-12 12:54:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:54:19,046 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-12 12:54:19,048 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-12 12:54:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:54:19,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:54:19,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:54:19,220 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-12 12:54:19,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:54:19,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:54:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63002607] [2024-11-12 12:54:19,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63002607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:54:19,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:54:19,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:54:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188138578] [2024-11-12 12:54:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:54:19,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:54:19,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:54:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:54:19,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:54:19,264 INFO L87 Difference]: Start difference. First operand has 251 states, 241 states have (on average 1.6556016597510372) internal successors, (399), 243 states have internal predecessors, (399), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:23,349 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-12 12:54:27,406 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-12 12:54:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:54:27,774 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2024-11-12 12:54:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:54:27,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 12:54:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:54:27,790 INFO L225 Difference]: With dead ends: 314 [2024-11-12 12:54:27,790 INFO L226 Difference]: Without dead ends: 310 [2024-11-12 12:54:27,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:54:27,794 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 81 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-12 12:54:27,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 659 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2024-11-12 12:54:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-12 12:54:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2024-11-12 12:54:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 251 states have (on average 1.298804780876494) internal successors, (326), 252 states have internal predecessors, (326), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:54:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2024-11-12 12:54:27,837 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 4 [2024-11-12 12:54:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:54:27,838 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2024-11-12 12:54:27,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2024-11-12 12:54:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 12:54:27,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:54:27,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:54:27,846 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-12 12:54:28,044 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-12 12:54:28,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:54:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:54:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -227637592, now seen corresponding path program 1 times [2024-11-12 12:54:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:54:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710926663] [2024-11-12 12:54:28,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:54:28,047 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-12 12:54:28,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:54:28,050 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-12 12:54:28,051 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-12 12:54:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:54:28,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 12:54:28,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:54:28,230 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-12 12:54:28,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:54:28,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:54:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710926663] [2024-11-12 12:54:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710926663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:54:28,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:54:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:54:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799998405] [2024-11-12 12:54:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:54:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:54:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:54:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:54:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:54:28,233 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:32,770 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-12 12:54:36,905 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-12 12:54:38,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:54:44,540 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-12 12:54:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:54:45,638 INFO L93 Difference]: Finished difference Result 379 states and 492 transitions. [2024-11-12 12:54:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:54:45,641 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 12:54:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:54:45,643 INFO L225 Difference]: With dead ends: 379 [2024-11-12 12:54:45,643 INFO L226 Difference]: Without dead ends: 379 [2024-11-12 12:54:45,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-12 12:54:45,644 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 156 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:54:45,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 882 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 17.4s Time] [2024-11-12 12:54:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-12 12:54:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-12 12:54:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.2915531335149864) internal successors, (474), 368 states have internal predecessors, (474), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:54:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 492 transitions. [2024-11-12 12:54:45,668 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 492 transitions. Word has length 11 [2024-11-12 12:54:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:54:45,668 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 492 transitions. [2024-11-12 12:54:45,668 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 492 transitions. [2024-11-12 12:54:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 12:54:45,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:54:45,670 INFO L218 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] [2024-11-12 12:54:45,677 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-12 12:54:45,873 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-12 12:54:45,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:54:45,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:54:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2107068027, now seen corresponding path program 1 times [2024-11-12 12:54:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:54:45,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263190212] [2024-11-12 12:54:45,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:54:45,875 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-12 12:54:45,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:54:45,877 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-12 12:54:45,878 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-12 12:54:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:54:46,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:54:46,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:54:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:54:46,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:54:46,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:54:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263190212] [2024-11-12 12:54:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263190212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:54:46,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:54:46,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:54:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306614903] [2024-11-12 12:54:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:54:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:54:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:54:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:54:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:54:46,080 INFO L87 Difference]: Start difference. First operand 379 states and 492 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:54:46,611 INFO L93 Difference]: Finished difference Result 431 states and 559 transitions. [2024-11-12 12:54:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:54:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 12:54:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:54:46,617 INFO L225 Difference]: With dead ends: 431 [2024-11-12 12:54:46,617 INFO L226 Difference]: Without dead ends: 431 [2024-11-12 12:54:46,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:54:46,619 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 121 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 12:54:46,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 608 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 12:54:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-12 12:54:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 377. [2024-11-12 12:54:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.2876712328767124) internal successors, (470), 366 states have internal predecessors, (470), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:54:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 488 transitions. [2024-11-12 12:54:46,633 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 488 transitions. Word has length 27 [2024-11-12 12:54:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:54:46,633 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 488 transitions. [2024-11-12 12:54:46,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 488 transitions. [2024-11-12 12:54:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 12:54:46,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:54:46,634 INFO L218 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] [2024-11-12 12:54:46,639 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-12 12:54:46,834 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-12 12:54:46,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:54:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:54:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1289419577, now seen corresponding path program 1 times [2024-11-12 12:54:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:54:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466569215] [2024-11-12 12:54:46,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:54:46,836 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-12 12:54:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:54:46,839 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-12 12:54:46,840 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-12 12:54:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:54:46,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 12:54:46,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:54:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:54:47,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:54:47,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:54:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466569215] [2024-11-12 12:54:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466569215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:54:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:54:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:54:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799884212] [2024-11-12 12:54:47,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:54:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:54:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:54:47,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:54:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:54:47,051 INFO L87 Difference]: Start difference. First operand 377 states and 488 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:51,431 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-12 12:54:55,833 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-12 12:54:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:54:59,262 INFO L93 Difference]: Finished difference Result 431 states and 558 transitions. [2024-11-12 12:54:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:54:59,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 12:54:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:54:59,266 INFO L225 Difference]: With dead ends: 431 [2024-11-12 12:54:59,266 INFO L226 Difference]: Without dead ends: 425 [2024-11-12 12:54:59,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12 12:54:59,267 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 123 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:54:59,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 916 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 12.2s Time] [2024-11-12 12:54:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-12 12:54:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 371. [2024-11-12 12:54:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 359 states have (on average 1.2896935933147633) internal successors, (463), 360 states have internal predecessors, (463), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:54:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 481 transitions. [2024-11-12 12:54:59,286 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 481 transitions. Word has length 27 [2024-11-12 12:54:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:54:59,286 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 481 transitions. [2024-11-12 12:54:59,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:54:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 481 transitions. [2024-11-12 12:54:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 12:54:59,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:54:59,291 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:54:59,297 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-12 12:54:59,492 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-12 12:54:59,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:54:59,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:54:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1665770981, now seen corresponding path program 1 times [2024-11-12 12:54:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:54:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947001842] [2024-11-12 12:54:59,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:54:59,499 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-12 12:54:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:54:59,501 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-12 12:54:59,505 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-12 12:55:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:00,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:55:00,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 12:55:00,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:00,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947001842] [2024-11-12 12:55:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947001842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:55:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360190657] [2024-11-12 12:55:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:55:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:55:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:55:00,138 INFO L87 Difference]: Start difference. First operand 371 states and 481 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 12:55:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:00,270 INFO L93 Difference]: Finished difference Result 377 states and 471 transitions. [2024-11-12 12:55:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:55:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 147 [2024-11-12 12:55:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:00,272 INFO L225 Difference]: With dead ends: 377 [2024-11-12 12:55:00,272 INFO L226 Difference]: Without dead ends: 377 [2024-11-12 12:55:00,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:55:00,273 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 41 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:00,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 850 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-12 12:55:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-12 12:55:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 366 states have internal predecessors, (453), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:55:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-11-12 12:55:00,286 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 147 [2024-11-12 12:55:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-11-12 12:55:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 12:55:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-11-12 12:55:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 12:55:00,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:00,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:00,323 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-12 12:55:00,496 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-12 12:55:00,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:00,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1359410743, now seen corresponding path program 1 times [2024-11-12 12:55:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978246223] [2024-11-12 12:55:00,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:00,499 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-12 12:55:00,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:00,502 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-12 12:55:00,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 12:55:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:01,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:55:01,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 12:55:01,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:01,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:01,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978246223] [2024-11-12 12:55:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978246223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:01,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:55:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057098680] [2024-11-12 12:55:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:01,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:55:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:01,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:55:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:55:01,177 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 12:55:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:01,276 INFO L93 Difference]: Finished difference Result 365 states and 451 transitions. [2024-11-12 12:55:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:55:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 147 [2024-11-12 12:55:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:01,278 INFO L225 Difference]: With dead ends: 365 [2024-11-12 12:55:01,278 INFO L226 Difference]: Without dead ends: 365 [2024-11-12 12:55:01,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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-12 12:55:01,279 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 9 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:01,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 851 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-12 12:55:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-12 12:55:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.226628895184136) internal successors, (433), 354 states have internal predecessors, (433), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:55:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 451 transitions. [2024-11-12 12:55:01,286 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 451 transitions. Word has length 147 [2024-11-12 12:55:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:01,286 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 451 transitions. [2024-11-12 12:55:01,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 12:55:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 451 transitions. [2024-11-12 12:55:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 12:55:01,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:01,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:01,304 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-12 12:55:01,489 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-12 12:55:01,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:01,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash -336215087, now seen corresponding path program 1 times [2024-11-12 12:55:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709287271] [2024-11-12 12:55:01,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:01,492 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-12 12:55:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:01,496 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-12 12:55:01,498 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-12 12:55:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:02,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:55:02,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 12:55:02,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:02,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709287271] [2024-11-12 12:55:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709287271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:55:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72959884] [2024-11-12 12:55:02,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:02,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:55:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:02,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:55:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:55:02,142 INFO L87 Difference]: Start difference. First operand 365 states and 451 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:02,218 INFO L93 Difference]: Finished difference Result 368 states and 457 transitions. [2024-11-12 12:55:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:55:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 147 [2024-11-12 12:55:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:02,222 INFO L225 Difference]: With dead ends: 368 [2024-11-12 12:55:02,222 INFO L226 Difference]: Without dead ends: 368 [2024-11-12 12:55:02,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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-12 12:55:02,223 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:02,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 899 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-12 12:55:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-12 12:55:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 355 states have (on average 1.228169014084507) internal successors, (436), 357 states have internal predecessors, (436), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 457 transitions. [2024-11-12 12:55:02,232 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 457 transitions. Word has length 147 [2024-11-12 12:55:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:02,232 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 457 transitions. [2024-11-12 12:55:02,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 457 transitions. [2024-11-12 12:55:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 12:55:02,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:02,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:02,248 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-12 12:55:02,434 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-12 12:55:02,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:02,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash -21562027, now seen corresponding path program 1 times [2024-11-12 12:55:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856343694] [2024-11-12 12:55:02,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:02,449 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-12 12:55:02,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:02,450 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-12 12:55:02,452 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-12 12:55:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:03,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:55:03,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 12:55:03,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 12:55:03,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856343694] [2024-11-12 12:55:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856343694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:03,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 12:55:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501122298] [2024-11-12 12:55:03,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:03,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:55:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:55:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:55:03,362 INFO L87 Difference]: Start difference. First operand 368 states and 457 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:03,648 INFO L93 Difference]: Finished difference Result 379 states and 475 transitions. [2024-11-12 12:55:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:55:03,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2024-11-12 12:55:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:03,651 INFO L225 Difference]: With dead ends: 379 [2024-11-12 12:55:03,652 INFO L226 Difference]: Without dead ends: 379 [2024-11-12 12:55:03,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:55:03,652 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 5 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:03,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1195 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:55:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-12 12:55:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2024-11-12 12:55:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 363 states have (on average 1.2396694214876034) internal successors, (450), 365 states have internal predecessors, (450), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-11-12 12:55:03,663 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 151 [2024-11-12 12:55:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:03,663 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-11-12 12:55:03,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-11-12 12:55:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 12:55:03,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:03,664 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:03,685 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 12:55:03,865 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-12 12:55:03,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 427997521, now seen corresponding path program 2 times [2024-11-12 12:55:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204699580] [2024-11-12 12:55:03,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:55:03,868 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-12 12:55:03,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:03,871 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-12 12:55:03,872 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-12 12:55:04,613 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:55:04,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:04,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 12:55:04,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 12:55:04,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-12 12:55:04,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:04,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204699580] [2024-11-12 12:55:04,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204699580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:04,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:04,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 12:55:04,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768256486] [2024-11-12 12:55:04,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:04,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 12:55:04,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 12:55:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 12:55:04,911 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:05,449 INFO L93 Difference]: Finished difference Result 392 states and 495 transitions. [2024-11-12 12:55:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:55:05,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 159 [2024-11-12 12:55:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:05,453 INFO L225 Difference]: With dead ends: 392 [2024-11-12 12:55:05,453 INFO L226 Difference]: Without dead ends: 388 [2024-11-12 12:55:05,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 12:55:05,454 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 8 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:05,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1794 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 12:55:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-12 12:55:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-12 12:55:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 372 states have (on average 1.2419354838709677) internal successors, (462), 374 states have internal predecessors, (462), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 483 transitions. [2024-11-12 12:55:05,464 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 483 transitions. Word has length 159 [2024-11-12 12:55:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 483 transitions. [2024-11-12 12:55:05,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 483 transitions. [2024-11-12 12:55:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-12 12:55:05,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:05,467 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:05,489 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-12 12:55:05,667 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-12 12:55:05,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1949202699, now seen corresponding path program 3 times [2024-11-12 12:55:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274580782] [2024-11-12 12:55:05,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 12:55:05,670 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-12 12:55:05,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:05,671 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-12 12:55:05,673 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-12 12:55:07,473 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-12 12:55:07,473 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:07,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 12:55:07,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-12 12:55:07,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-12 12:55:08,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274580782] [2024-11-12 12:55:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274580782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:08,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 12:55:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038761433] [2024-11-12 12:55:08,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:08,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 12:55:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:08,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 12:55:08,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-12 12:55:08,040 INFO L87 Difference]: Start difference. First operand 386 states and 483 transitions. Second operand has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 12:55:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:08,758 INFO L93 Difference]: Finished difference Result 397 states and 502 transitions. [2024-11-12 12:55:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 12:55:08,759 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 177 [2024-11-12 12:55:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:08,762 INFO L225 Difference]: With dead ends: 397 [2024-11-12 12:55:08,763 INFO L226 Difference]: Without dead ends: 395 [2024-11-12 12:55:08,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-12 12:55:08,767 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 9 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:08,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2968 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 12:55:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-12 12:55:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-11-12 12:55:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 379 states have (on average 1.2532981530343008) internal successors, (475), 381 states have internal predecessors, (475), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-11-12 12:55:08,781 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 177 [2024-11-12 12:55:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:08,781 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-11-12 12:55:08,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 12:55:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-11-12 12:55:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 12:55:08,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:08,784 INFO L218 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:08,801 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-12 12:55:08,988 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-12 12:55:08,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -463141935, now seen corresponding path program 4 times [2024-11-12 12:55:08,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:08,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890773040] [2024-11-12 12:55:08,991 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 12:55:08,991 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-12 12:55:08,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:08,993 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-12 12:55:08,994 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-12 12:55:09,607 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 12:55:09,607 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:09,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 12:55:09,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-12 12:55:09,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:09,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890773040] [2024-11-12 12:55:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890773040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:09,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:55:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192372552] [2024-11-12 12:55:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:09,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:55:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:55:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:55:09,672 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:09,802 INFO L93 Difference]: Finished difference Result 433 states and 536 transitions. [2024-11-12 12:55:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:55:09,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-12 12:55:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:09,804 INFO L225 Difference]: With dead ends: 433 [2024-11-12 12:55:09,804 INFO L226 Difference]: Without dead ends: 433 [2024-11-12 12:55:09,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:55:09,805 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:09,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 557 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-12 12:55:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-11-12 12:55:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 419 states have (on average 1.2291169451073987) internal successors, (515), 421 states have internal predecessors, (515), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 536 transitions. [2024-11-12 12:55:09,817 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 536 transitions. Word has length 191 [2024-11-12 12:55:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:09,818 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 536 transitions. [2024-11-12 12:55:09,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 536 transitions. [2024-11-12 12:55:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 12:55:09,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:09,819 INFO L218 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:09,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 12:55:10,019 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-12 12:55:10,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1302175597, now seen corresponding path program 1 times [2024-11-12 12:55:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215423383] [2024-11-12 12:55:10,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:10,021 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-12 12:55:10,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:10,022 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-12 12:55:10,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 (13)] Waiting until timeout for monitored process [2024-11-12 12:55:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:10,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 12:55:10,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 417 proven. 55 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-11-12 12:55:11,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 1 proven. 468 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-12 12:55:11,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215423383] [2024-11-12 12:55:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215423383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:11,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 12:55:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647017185] [2024-11-12 12:55:11,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 12:55:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 12:55:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 12:55:11,908 INFO L87 Difference]: Start difference. First operand 433 states and 536 transitions. Second operand has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:14,088 INFO L93 Difference]: Finished difference Result 451 states and 566 transitions. [2024-11-12 12:55:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 12:55:14,089 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2024-11-12 12:55:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:14,091 INFO L225 Difference]: With dead ends: 451 [2024-11-12 12:55:14,091 INFO L226 Difference]: Without dead ends: 447 [2024-11-12 12:55:14,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 12:55:14,092 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 13 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:14,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3583 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 12:55:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-12 12:55:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2024-11-12 12:55:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 431 states have (on average 1.222737819025522) internal successors, (527), 433 states have internal predecessors, (527), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 548 transitions. [2024-11-12 12:55:14,099 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 548 transitions. Word has length 191 [2024-11-12 12:55:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:14,099 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 548 transitions. [2024-11-12 12:55:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 548 transitions. [2024-11-12 12:55:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-12 12:55:14,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:14,101 INFO L218 NwaCegarLoop]: trace histogram [68, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:14,119 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-12 12:55:14,301 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-12 12:55:14,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:14,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1257011091, now seen corresponding path program 2 times [2024-11-12 12:55:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455364450] [2024-11-12 12:55:14,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:55: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-12 12:55:14,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:14,306 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-12 12:55: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 (14)] Waiting until timeout for monitored process [2024-11-12 12:55:15,231 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:55:15,231 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:15,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 12:55:15,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1137 proven. 253 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2024-11-12 12:55:15,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1 proven. 1386 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2024-11-12 12:55:17,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:17,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455364450] [2024-11-12 12:55:17,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455364450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:17,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:17,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 12:55:17,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523875489] [2024-11-12 12:55:17,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:17,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 12:55:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:17,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 12:55:17,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 12:55:17,753 INFO L87 Difference]: Start difference. First operand 445 states and 548 transitions. Second operand has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:24,969 INFO L93 Difference]: Finished difference Result 484 states and 620 transitions. [2024-11-12 12:55:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 12:55:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 215 [2024-11-12 12:55:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:24,971 INFO L225 Difference]: With dead ends: 484 [2024-11-12 12:55:24,972 INFO L226 Difference]: Without dead ends: 480 [2024-11-12 12:55:24,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 12:55:24,974 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 25 mSDsluCounter, 6857 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7158 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:24,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7158 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 12:55:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-12 12:55:24,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2024-11-12 12:55:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 464 states have (on average 1.230603448275862) internal successors, (571), 466 states have internal predecessors, (571), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 12:55:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 592 transitions. [2024-11-12 12:55:24,982 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 592 transitions. Word has length 215 [2024-11-12 12:55:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:24,982 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 592 transitions. [2024-11-12 12:55:24,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 12:55:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 592 transitions. [2024-11-12 12:55:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-12 12:55:24,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:24,986 INFO L218 NwaCegarLoop]: trace histogram [134, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:55:25,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-12 12:55:25,188 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-12 12:55:25,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1258567283, now seen corresponding path program 3 times [2024-11-12 12:55:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844744933] [2024-11-12 12:55:25,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 12:55:25,190 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-12 12:55:25,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:25,195 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-12 12:55:25,199 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-12 12:55:29,298 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-11-12 12:55:29,298 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:29,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 12:55:29,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9472 backedges. 2743 proven. 276 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2024-11-12 12:55:29,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9472 backedges. 2743 proven. 276 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2024-11-12 12:55:32,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844744933] [2024-11-12 12:55:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844744933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:32,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-12 12:55:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378225966] [2024-11-12 12:55:32,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:32,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 12:55:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:32,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 12:55:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 12:55:32,218 INFO L87 Difference]: Start difference. First operand 478 states and 592 transitions. Second operand has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)