./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/ldv-memsafety/memleaks_test18_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:28:38,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:28:38,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:28:38,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:28:38,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:28:38,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:28:38,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:28:38,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:28:38,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:28:38,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:28:38,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:28:38,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:28:38,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:28:38,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:28:38,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:28:38,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:28:38,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:28:38,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:28:38,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:28:38,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:28:38,963 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:28:38,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:28:38,965 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:28:38,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:28:38,965 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:28:38,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:28:38,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:28:38,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:28:38,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:28:38,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:28:38,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:28:38,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:28:38,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:28:38,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:38,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:28:38,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:28:38,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:28:38,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:28:38,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:28:38,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:28:38,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:28:38,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:28:38,971 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2024-11-12 13:28:39,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:28:39,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:28:39,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:28:39,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:28:39,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:28:39,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-12 13:28:40,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:28:40,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:28:40,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-12 13:28:40,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acb038df/9aea8a7b8cbe417597b4221a623dada3/FLAG95ee91bc5 [2024-11-12 13:28:40,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acb038df/9aea8a7b8cbe417597b4221a623dada3 [2024-11-12 13:28:40,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:28:40,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:28:41,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:41,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:28:41,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:28:41,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:40" (1/1) ... [2024-11-12 13:28:41,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511daaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:41, skipping insertion in model container [2024-11-12 13:28:41,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:40" (1/1) ... [2024-11-12 13:28:41,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:41,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 13:28:41,451 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 13:28:41,457 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 13:28:41,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:41,482 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 13:28:41,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b806965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:41, skipping insertion in model container [2024-11-12 13:28:41,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:41,483 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:28:41,485 INFO L158 Benchmark]: Toolchain (without parser) took 486.12ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 94.7MB in the beginning and 188.1MB in the end (delta: -93.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 13:28:41,486 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:28:41,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.67ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 94.5MB in the beginning and 188.1MB in the end (delta: -93.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 13:28:41,489 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.67ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 94.5MB in the beginning and 188.1MB in the end (delta: -93.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test18_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:28:43,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:28:43,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 13:28:43,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:28:43,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:28:43,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:28:43,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:28:43,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:28:43,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:28:43,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:28:43,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:28:43,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:28:43,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:28:43,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:28:43,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:28:43,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:28:43,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:28:43,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:28:43,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:28:43,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:28:43,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:28:43,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:28:43,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:28:43,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:28:43,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:28:43,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:28:43,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:28:43,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:28:43,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:28:43,684 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:28:43,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:28:43,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:28:43,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:28:43,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:28:43,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:28:43,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:43,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:28:43,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:28:43,697 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:28:43,698 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:43,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:28:43,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:28:43,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:28:43,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:28:43,699 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2024-11-12 13:28:44,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:28:44,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:28:44,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:28:44,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:28:44,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:28:44,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-12 13:28:45,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:28:45,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:28:45,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-12 13:28:45,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce981bde/7db20629b9184d7197a367f77241fb3e/FLAG9b8c1cae6 [2024-11-12 13:28:46,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ce981bde/7db20629b9184d7197a367f77241fb3e [2024-11-12 13:28:46,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:28:46,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:28:46,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:46,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:28:46,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:28:46,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:46,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a4a54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46, skipping insertion in model container [2024-11-12 13:28:46,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:46,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:46,613 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 13:28:46,683 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 13:28:46,684 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 13:28:46,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:46,714 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:28:46,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:46,746 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 13:28:46,770 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 13:28:46,771 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 13:28:46,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:46,779 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:28:46,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:46,900 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:28:46,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46 WrapperNode [2024-11-12 13:28:46,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:46,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:28:46,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:28:46,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:28:46,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:46,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:46,969 INFO L138 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 30 [2024-11-12 13:28:46,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:28:46,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:28:46,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:28:46,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:28:46,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:46,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:46,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,004 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-12 13:28:47,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:28:47,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:28:47,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:28:47,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:28:47,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (1/1) ... [2024-11-12 13:28:47,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:28:47,062 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 13:28:47,066 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 13:28:47,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-12 13:28:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:28:47,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:28:47,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:28:47,228 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:28:47,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:28:47,399 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 13:28:47,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:28:47,415 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:28:47,416 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:28:47,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:47 BoogieIcfgContainer [2024-11-12 13:28:47,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:28:47,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:28:47,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:28:47,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:28:47,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:28:46" (1/3) ... [2024-11-12 13:28:47,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f5596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:47, skipping insertion in model container [2024-11-12 13:28:47,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:46" (2/3) ... [2024-11-12 13:28:47,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f5596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:47, skipping insertion in model container [2024-11-12 13:28:47,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:47" (3/3) ... [2024-11-12 13:28:47,428 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2024-11-12 13:28:47,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:28:47,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-12 13:28:47,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:28:47,504 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;@8ea53f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:28:47,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-12 13:28:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:28:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:28:47,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:47,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:47,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:28:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -74700687, now seen corresponding path program 1 times [2024-11-12 13:28:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:47,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892034247] [2024-11-12 13:28:47,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:47,537 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 13:28:47,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:47,541 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 13:28:47,542 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 13:28:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:47,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:47,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:47,752 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 13:28:47,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:47,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:47,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892034247] [2024-11-12 13:28:47,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892034247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:47,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:28:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508096573] [2024-11-12 13:28:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:28:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:28:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:47,784 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:47,856 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-12 13:28:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:28:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:28:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:47,866 INFO L225 Difference]: With dead ends: 31 [2024-11-12 13:28:47,867 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 13:28:47,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:47,872 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:47,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 13:28:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2024-11-12 13:28:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:28:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-12 13:28:47,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 11 [2024-11-12 13:28:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:47,912 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-12 13:28:47,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-12 13:28:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:28:47,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:47,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:47,919 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 13:28:48,115 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 13:28:48,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:28:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash 812802994, now seen corresponding path program 1 times [2024-11-12 13:28:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829699858] [2024-11-12 13:28:48,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:48,118 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 13:28:48,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:48,121 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 13:28:48,123 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 13:28:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:48,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:48,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:48,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 13:28:48,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:48,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829699858] [2024-11-12 13:28:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829699858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:48,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:28:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962270377] [2024-11-12 13:28:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:48,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:28:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:48,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:28:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:48,243 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:48,310 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-12 13:28:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:28:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:28:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:48,313 INFO L225 Difference]: With dead ends: 32 [2024-11-12 13:28:48,314 INFO L226 Difference]: Without dead ends: 30 [2024-11-12 13:28:48,315 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 13:28:48,316 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:48,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-12 13:28:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-12 13:28:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:28:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-12 13:28:48,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-12 13:28:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:48,328 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-12 13:28:48,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-12 13:28:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:28:48,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:48,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:48,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 13:28:48,529 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 13:28:48,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:28:48,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1979292102, now seen corresponding path program 1 times [2024-11-12 13:28:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:48,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702272957] [2024-11-12 13:28:48,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:48,533 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 13:28:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:48,535 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 13:28:48,536 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 13:28:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:48,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:28:48,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:48,679 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 13:28:48,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:48,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702272957] [2024-11-12 13:28:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702272957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:28:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439495688] [2024-11-12 13:28:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:28:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:28:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:48,685 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:48,739 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2024-11-12 13:28:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:28:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 13:28:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:48,744 INFO L225 Difference]: With dead ends: 39 [2024-11-12 13:28:48,744 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 13:28:48,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:48,745 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:48,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:28:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 13:28:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2024-11-12 13:28:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:28:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-12 13:28:48,758 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 12 [2024-11-12 13:28:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:48,759 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-12 13:28:48,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-12 13:28:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:28:48,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:48,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:48,765 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 13:28:48,964 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 13:28:48,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:28:48,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -938120081, now seen corresponding path program 1 times [2024-11-12 13:28:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955771374] [2024-11-12 13:28:48,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:48,966 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 13:28:48,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:48,970 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 13:28:48,972 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 13:28:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:49,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:28:49,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:49,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:28:49,239 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:28:49,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:28:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:49,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:00,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:00,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955771374] [2024-11-12 13:29:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955771374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:00,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 13:29:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575728578] [2024-11-12 13:29:00,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:29:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:29:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2024-11-12 13:29:00,607 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:29:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:00,816 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-12 13:29:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:29:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-11-12 13:29:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:00,818 INFO L225 Difference]: With dead ends: 35 [2024-11-12 13:29:00,818 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 13:29:00,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2024-11-12 13:29:00,819 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:00,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 13:29:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 13:29:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 13:29:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-12 13:29:00,825 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 17 [2024-11-12 13:29:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:00,826 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-12 13:29:00,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:29:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-12 13:29:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:29:00,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:00,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:00,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 13:29:01,030 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 13:29:01,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:01,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash -938120080, now seen corresponding path program 1 times [2024-11-12 13:29:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:01,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516959828] [2024-11-12 13:29:01,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:01,032 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 13:29:01,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:01,035 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 13:29:01,036 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 13:29:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:01,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:29:01,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:01,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:01,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:01,359 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:01,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:01,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:01,416 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:01,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:29:01,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:05,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516959828] [2024-11-12 13:29:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516959828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:05,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1711010056] [2024-11-12 13:29:05,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:05,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:05,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:05,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:05,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-12 13:29:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:05,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:29:05,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:05,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:05,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:06,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:06,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:06,105 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:06,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:29:06,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1711010056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:10,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-12 13:29:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573723813] [2024-11-12 13:29:10,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:10,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:29:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:29:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=87, Unknown=2, NotChecked=18, Total=132 [2024-11-12 13:29:10,357 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:10,683 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2024-11-12 13:29:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:29:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-12 13:29:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:10,687 INFO L225 Difference]: With dead ends: 41 [2024-11-12 13:29:10,688 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 13:29:10,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=49, Invalid=193, Unknown=2, NotChecked=28, Total=272 [2024-11-12 13:29:10,689 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:10,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2024-11-12 13:29:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 13:29:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-12 13:29:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-12 13:29:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-12 13:29:10,698 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 17 [2024-11-12 13:29:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:10,698 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-12 13:29:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-12 13:29:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:29:10,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:10,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:10,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:10,905 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 13:29:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 13:29:11,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1231523088, now seen corresponding path program 1 times [2024-11-12 13:29:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660510297] [2024-11-12 13:29:11,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:11,104 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 13:29:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:11,105 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 13:29:11,106 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 13:29:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:11,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:29:11,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:11,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:11,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:11,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660510297] [2024-11-12 13:29:11,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660510297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:11,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:11,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:29:11,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474154641] [2024-11-12 13:29:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:11,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:11,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:11,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:11,201 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:11,233 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-12 13:29:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:11,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-12 13:29:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:11,234 INFO L225 Difference]: With dead ends: 26 [2024-11-12 13:29:11,235 INFO L226 Difference]: Without dead ends: 24 [2024-11-12 13:29:11,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:11,236 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:11,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-12 13:29:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-12 13:29:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:29:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-12 13:29:11,240 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-11-12 13:29:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-12 13:29:11,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-12 13:29:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:29:11,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:11,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:11,245 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 13:29:11,444 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 13:29:11,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1382319161, now seen corresponding path program 1 times [2024-11-12 13:29:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052667206] [2024-11-12 13:29:11,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:11,446 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 13:29:11,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:11,447 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 13:29:11,448 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 13:29:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:11,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:29:11,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:11,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:11,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052667206] [2024-11-12 13:29:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052667206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:11,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 13:29:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350459710] [2024-11-12 13:29:11,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:11,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:29:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:11,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:29:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:29:11,662 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:11,773 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-11-12 13:29:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:29:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-11-12 13:29:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:11,774 INFO L225 Difference]: With dead ends: 36 [2024-11-12 13:29:11,775 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 13:29:11,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:29:11,776 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 13:29:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 13:29:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-12 13:29:11,781 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 21 [2024-11-12 13:29:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-12 13:29:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-12 13:29:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:29:11,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:11,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:11,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 13:29:11,986 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 13:29:11,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:11,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -704273649, now seen corresponding path program 1 times [2024-11-12 13:29:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794761878] [2024-11-12 13:29:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:11,988 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 13:29:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:11,989 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 13:29:11,990 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 13:29:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:12,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 13:29:12,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:12,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:12,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:12,265 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:12,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:12,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:12,327 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:12,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:12,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:12,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:12,506 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:12,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:29:12,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:12,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794761878] [2024-11-12 13:29:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794761878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1606394631] [2024-11-12 13:29:12,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:12,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:12,821 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:12,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-12 13:29:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:12,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 13:29:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:12,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:12,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:13,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:13,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:13,104 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:13,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:13,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:13,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:13,243 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:13,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:29:13,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:13,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1606394631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:13,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-12 13:29:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560027866] [2024-11-12 13:29:13,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:29:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:29:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:29:13,462 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:13,867 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-12 13:29:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:29:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-11-12 13:29:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:13,868 INFO L225 Difference]: With dead ends: 40 [2024-11-12 13:29:13,868 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 13:29:13,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=313, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:29:13,869 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:13,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2024-11-12 13:29:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 13:29:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-12 13:29:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-12 13:29:13,873 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 26 [2024-11-12 13:29:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:13,874 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-12 13:29:13,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-12 13:29:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:29:13,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:13,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:13,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-12 13:29:14,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:14,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 13:29:14,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:14,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1383108784, now seen corresponding path program 2 times [2024-11-12 13:29:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:14,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95616061] [2024-11-12 13:29:14,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:14,277 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 13:29:14,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:14,278 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 13:29:14,283 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 13:29:14,378 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:14,378 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:14,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 13:29:14,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:14,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:14,589 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:14,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:14,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:14,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:14,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:14,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:14,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:14,849 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:14,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:15,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:15,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:15,033 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:15,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-12 13:29:15,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:19,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95616061] [2024-11-12 13:29:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95616061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [812551938] [2024-11-12 13:29:19,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:19,276 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:19,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-12 13:29:19,400 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:19,401 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:19,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 13:29:19,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:19,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:19,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:19,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:19,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:19,568 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:19,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:19,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:19,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:19,681 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:19,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:19,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:19,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:19,802 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:19,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-12 13:29:19,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [812551938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:19,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-12 13:29:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353462080] [2024-11-12 13:29:19,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:29:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:19,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:29:19,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=171, Unknown=2, NotChecked=26, Total=240 [2024-11-12 13:29:19,988 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:20,494 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-12 13:29:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:29:20,495 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-11-12 13:29:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:20,496 INFO L225 Difference]: With dead ends: 42 [2024-11-12 13:29:20,496 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 13:29:20,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=91, Invalid=463, Unknown=2, NotChecked=44, Total=600 [2024-11-12 13:29:20,497 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:20,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 128 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 290 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2024-11-12 13:29:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 13:29:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-12 13:29:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 29 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-12 13:29:20,505 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 35 [2024-11-12 13:29:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:20,506 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-12 13:29:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-12 13:29:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:29:20,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:20,508 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:20,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-12 13:29:20,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:20,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 13:29:20,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:20,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -856630225, now seen corresponding path program 3 times [2024-11-12 13:29:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27408293] [2024-11-12 13:29:20,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 13:29:20,910 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 13:29:20,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:20,911 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 13:29:20,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 13:29:21,042 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-12 13:29:21,042 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:21,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:29:21,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:21,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:21,178 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-12 13:29:21,204 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-12 13:29:21,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-12 13:29:21,514 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:21,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:21,562 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 13:29:21,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-12 13:29:21,581 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:21,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:21,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:21,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:21,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:21,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:21,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:21,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:21,956 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:21,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-11-12 13:29:21,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:22,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:22,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27408293] [2024-11-12 13:29:22,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27408293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1971871422] [2024-11-12 13:29:22,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 13:29:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:22,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:22,286 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:22,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-12 13:29:22,471 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-12 13:29:22,471 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:22,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 13:29:22,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:22,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:22,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:22,746 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:29:22,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:29:22,761 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:22,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:22,926 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:29:22,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:29:22,942 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:22,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:23,121 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:29:23,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:29:23,135 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:23,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:23,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:23,311 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:23,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 18 trivial. 8 not checked. [2024-11-12 13:29:23,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:27,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_entry_point_~i~0#1|))) (let ((.cse0 (bvadd (_ bv4 32) .cse1 |c_ULTIMATE.start_entry_point_~array~0#1.offset|))) (and (forall ((|v_ldv_malloc_#res.base_41| (_ BitVec 32))) (or (forall ((v_ArrVal_216 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_41| v_ArrVal_216) |c_ULTIMATE.start_entry_point_~array~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_41|))))) (or (bvule (bvadd .cse1 |c_ULTIMATE.start_entry_point_~array~0#1.offset|) .cse0) (forall ((|v_ldv_malloc_#res.base_41| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_41|)))))))) is different from false [2024-11-12 13:29:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1971871422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:27,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:27,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 30 [2024-11-12 13:29:27,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232809114] [2024-11-12 13:29:27,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:27,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-12 13:29:27,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 13:29:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=837, Unknown=3, NotChecked=180, Total=1122 [2024-11-12 13:29:27,412 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 31 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 25 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-12 13:29:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:28,924 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-12 13:29:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:29:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 25 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 44 [2024-11-12 13:29:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:28,926 INFO L225 Difference]: With dead ends: 54 [2024-11-12 13:29:28,926 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 13:29:28,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=209, Invalid=1962, Unknown=3, NotChecked=276, Total=2450 [2024-11-12 13:29:28,927 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 25 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:28,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 188 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 765 Invalid, 3 Unknown, 128 Unchecked, 1.0s Time] [2024-11-12 13:29:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 13:29:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2024-11-12 13:29:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-12 13:29:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-12 13:29:28,932 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 44 [2024-11-12 13:29:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:28,933 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-12 13:29:28,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 25 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-12 13:29:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-12 13:29:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:29:28,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:28,935 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:28,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-12 13:29:29,139 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 13:29:29,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 13:29:29,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash -206900218, now seen corresponding path program 2 times [2024-11-12 13:29:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:29,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195859996] [2024-11-12 13:29:29,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:29,337 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 13:29:29,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:29,340 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:29,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 13:29:29,421 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:29,422 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:29,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:29:29,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 13:29:29,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 13:29:29,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195859996] [2024-11-12 13:29:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195859996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:29,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:29,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 13:29:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945497807] [2024-11-12 13:29:29,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:29,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:29:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:29,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:29:29,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:29:29,705 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:29:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:29,966 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2024-11-12 13:29:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:29:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 48 [2024-11-12 13:29:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:29,967 INFO L225 Difference]: With dead ends: 66 [2024-11-12 13:29:29,967 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 13:29:29,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:29:29,968 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 74 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:29,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 175 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:29:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 13:29:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 13:29:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-12 13:29:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2024-11-12 13:29:29,974 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 48 [2024-11-12 13:29:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:29,975 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2024-11-12 13:29:29,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:29:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2024-11-12 13:29:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:29:29,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:29,977 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:29,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 13:29:30,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:30,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:30,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:30,178 INFO L85 PathProgramCache]: Analyzing trace with hash 845314608, now seen corresponding path program 4 times [2024-11-12 13:29:30,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:30,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278309426] [2024-11-12 13:29:30,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 13:29:30,178 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 13:29:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:30,180 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:29:30,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 13:29:30,303 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 13:29:30,303 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:30,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:29:30,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:30,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:30,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:30,437 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:30,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:30,466 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:30,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:30,596 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:30,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:30,742 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:30,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:30,860 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:30,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:30,976 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2024-11-12 13:29:31,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:35,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_entry_point_~i~0#1|))) (let ((.cse0 (bvadd (_ bv4 32) .cse1 |c_ULTIMATE.start_entry_point_~array~0#1.offset|))) (and (forall ((|v_ldv_malloc_#res.base_59| (_ BitVec 32))) (or (forall ((v_ArrVal_296 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ldv_malloc_#res.base_59| v_ArrVal_296) |c_ULTIMATE.start_entry_point_~array~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_59|))))) (or (bvule (bvadd .cse1 |c_ULTIMATE.start_entry_point_~array~0#1.offset|) .cse0) (forall ((|v_ldv_malloc_#res.base_59| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_59|)))))))) is different from false [2024-11-12 13:29:35,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278309426] [2024-11-12 13:29:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278309426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [523348392] [2024-11-12 13:29:35,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 13:29:35,145 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:35,146 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:35,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-12 13:29:35,329 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 13:29:35,329 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:29:35,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:35,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:35,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:35,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:35,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:35,473 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:35,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:35,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:35,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:35,567 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:35,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:35,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:35,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:35,660 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:35,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:35,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:35,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:35,776 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:35,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:35,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:35,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:35,888 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:35,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2024-11-12 13:29:35,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [523348392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:40,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2024-11-12 13:29:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112032740] [2024-11-12 13:29:40,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:40,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:29:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:40,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:29:40,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=288, Unknown=3, NotChecked=70, Total=420 [2024-11-12 13:29:40,184 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:29:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:41,056 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-11-12 13:29:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:29:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2024-11-12 13:29:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:41,058 INFO L225 Difference]: With dead ends: 76 [2024-11-12 13:29:41,058 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 13:29:41,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=135, Invalid=862, Unknown=3, NotChecked=122, Total=1122 [2024-11-12 13:29:41,059 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:41,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 193 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 480 Invalid, 0 Unknown, 65 Unchecked, 0.5s Time] [2024-11-12 13:29:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 13:29:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2024-11-12 13:29:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-12 13:29:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-11-12 13:29:41,068 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 53 [2024-11-12 13:29:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:41,069 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-11-12 13:29:41,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 13:29:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-11-12 13:29:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 13:29:41,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:41,073 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:41,080 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 (17)] Ended with exit code 0 [2024-11-12 13:29:41,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:41,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:41,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:41,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:41,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1540616881, now seen corresponding path program 5 times [2024-11-12 13:29:41,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:41,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559480569] [2024-11-12 13:29:41,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 13:29:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:29:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:41,477 INFO L229 MonitoredProcess]: Starting monitored process 19 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 13:29:41,478 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 (19)] Waiting until timeout for monitored process [2024-11-12 13:29:41,690 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-12 13:29:41,690 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:41,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-12 13:29:41,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:41,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:41,824 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-12 13:29:41,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-12 13:29:42,043 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:42,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:42,097 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 13:29:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-12 13:29:42,118 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:42,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:42,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:42,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:42,321 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:42,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:42,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:42,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:42,450 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:42,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:42,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:42,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:42,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:42,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:42,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:42,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:42,814 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:42,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 20 not checked. [2024-11-12 13:29:42,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:47,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:47,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559480569] [2024-11-12 13:29:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559480569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:47,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1544105463] [2024-11-12 13:29:47,223 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 13:29:47,223 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:47,224 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-12 13:29:47,546 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-12 13:29:47,546 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:47,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-12 13:29:47,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:47,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:47,641 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-12 13:29:47,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-12 13:29:47,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:47,830 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 13:29:47,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-12 13:29:47,843 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:47,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:47,950 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:47,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:47,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:48,011 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:29:48,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:29:48,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:48,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:48,126 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:29:48,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:29:48,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:48,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:48,212 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:48,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:48,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:48,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:48,282 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:48,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 32 not checked. [2024-11-12 13:29:48,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:48,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1544105463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:48,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:48,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2024-11-12 13:29:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744872322] [2024-11-12 13:29:48,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:48,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-12 13:29:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-12 13:29:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=625, Unknown=2, NotChecked=102, Total=812 [2024-11-12 13:29:48,546 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-12 13:29:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:50,075 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-11-12 13:29:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:29:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 62 [2024-11-12 13:29:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:50,077 INFO L225 Difference]: With dead ends: 74 [2024-11-12 13:29:50,077 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 13:29:50,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=175, Invalid=1553, Unknown=2, NotChecked=162, Total=1892 [2024-11-12 13:29:50,078 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 49 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:50,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 224 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 892 Invalid, 0 Unknown, 144 Unchecked, 1.0s Time] [2024-11-12 13:29:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 13:29:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2024-11-12 13:29:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-12 13:29:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2024-11-12 13:29:50,090 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 62 [2024-11-12 13:29:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:50,091 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2024-11-12 13:29:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-12 13:29:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2024-11-12 13:29:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 13:29:50,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:50,092 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:50,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:50,297 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 (19)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:50,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 13:29:50,493 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:29:50,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -446919408, now seen corresponding path program 6 times [2024-11-12 13:29:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:50,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434781246] [2024-11-12 13:29:50,494 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 13:29:50,494 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 13:29:50,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:50,497 INFO L229 MonitoredProcess]: Starting monitored process 21 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 13:29:50,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 (21)] Waiting until timeout for monitored process [2024-11-12 13:29:50,753 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-12 13:29:50,753 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:50,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-12 13:29:50,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:50,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:50,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:50,882 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:50,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:50,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:50,932 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:29:50,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 13:29:51,024 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:29:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:51,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:51,061 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:51,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:51,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:51,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:51,216 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:51,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:51,351 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-12 13:29:51,371 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-12 13:29:51,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-12 13:29:51,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:51,611 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 13:29:51,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-12 13:29:51,624 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:51,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:51,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:51,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:51,774 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:51,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:51,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:51,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:51,897 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:51,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 11 proven. 114 refuted. 0 times theorem prover too weak. 50 trivial. 36 not checked. [2024-11-12 13:29:51,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:52,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434781246] [2024-11-12 13:29:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434781246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769104907] [2024-11-12 13:29:52,212 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 13:29:52,212 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:52,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:52,213 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:52,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-12 13:29:52,607 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-12 13:29:52,607 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:52,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-12 13:29:52,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:52,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:29:52,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:29:52,782 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 13:29:52,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-12 13:29:52,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:53,167 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-12 13:29:53,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-12 13:29:53,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:53,420 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:29:53,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:29:53,459 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-12 13:29:53,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-12 13:29:53,834 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:29:53,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:29:53,859 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-12 13:29:53,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-12 13:29:54,163 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:54,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:54,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:54,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:54,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:54,404 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:54,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:54,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:54,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:29:54,477 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:54,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 124 refuted. 0 times theorem prover too weak. 46 trivial. 34 not checked. [2024-11-12 13:29:54,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:30:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [769104907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:30:00,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:30:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 42 [2024-11-12 13:30:00,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075017886] [2024-11-12 13:30:00,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:30:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-12 13:30:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:30:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-12 13:30:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1562, Unknown=3, NotChecked=246, Total=1980 [2024-11-12 13:30:00,618 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 37 states have internal predecessors, (66), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-12 13:30:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:30:03,348 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2024-11-12 13:30:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 13:30:03,348 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 37 states have internal predecessors, (66), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 71 [2024-11-12 13:30:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:30:03,349 INFO L225 Difference]: With dead ends: 96 [2024-11-12 13:30:03,349 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 13:30:03,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=381, Invalid=3918, Unknown=3, NotChecked=390, Total=4692 [2024-11-12 13:30:03,351 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 83 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:30:03,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 268 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1674 Invalid, 4 Unknown, 321 Unchecked, 1.8s Time] [2024-11-12 13:30:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 13:30:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2024-11-12 13:30:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 53 states have internal predecessors, (56), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-12 13:30:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2024-11-12 13:30:03,357 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 71 [2024-11-12 13:30:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:30:03,357 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2024-11-12 13:30:03,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 37 states have internal predecessors, (66), 12 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-12 13:30:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-12 13:30:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 13:30:03,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:30:03,361 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:30:03,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-12 13:30:03,566 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 (21)] Forceful destruction successful, exit code 0 [2024-11-12 13:30:03,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 13:30:03,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:30:03,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:30:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1800849809, now seen corresponding path program 7 times [2024-11-12 13:30:03,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:30:03,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115512265] [2024-11-12 13:30:03,762 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 13:30:03,762 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 13:30:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:30:03,763 INFO L229 MonitoredProcess]: Starting monitored process 23 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 13:30:03,765 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 (23)] Waiting until timeout for monitored process [2024-11-12 13:30:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:30:03,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-12 13:30:03,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:30:03,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:30:03,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:30:04,052 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-12 13:30:04,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,074 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,184 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,274 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,374 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,476 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,586 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,694 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:04,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:04,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:04,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2024-11-12 13:30:04,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:30:05,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:30:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115512265] [2024-11-12 13:30:05,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115512265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:30:05,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [843396830] [2024-11-12 13:30:05,077 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 13:30:05,077 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:30:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:30:05,078 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:30:05,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-12 13:30:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:30:05,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-12 13:30:05,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:30:05,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:30:05,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-12 13:30:05,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,601 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,661 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,723 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:05,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,794 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:05,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,856 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:05,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,927 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:05,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:05,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:05,990 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:05,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:06,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:30:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:30:06,070 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:30:06,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:30:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2024-11-12 13:30:06,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:30:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [843396830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:30:14,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:30:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2024-11-12 13:30:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417473604] [2024-11-12 13:30:14,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:30:14,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:30:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:30:14,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:30:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2024-11-12 13:30:14,300 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)