./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:48:19,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:48:19,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:48:19,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:48:19,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:48:19,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:48:19,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:48:19,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:48:19,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:48:19,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:48:19,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:48:19,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:48:19,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:48:19,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:48:19,266 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:48:19,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:48:19,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:48:19,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:48:19,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:48:19,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:48:19,268 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:48:19,269 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:48:19,269 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:48:19,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:48:19,269 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:48:19,270 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:48:19,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:48:19,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:48:19,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:48:19,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:48:19,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:48:19,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:48:19,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:48:19,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:48:19,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:48:19,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:48:19,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:48:19,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:48:19,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:48:19,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:48:19,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:48:19,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:48:19,275 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2024-11-19 06:48:19,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:48:19,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:48:19,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:48:19,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:48:19,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:48:19,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-19 06:48:20,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:48:21,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:48:21,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-19 06:48:21,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3353963e2/2cd9a5982b294c7ebd3818d2c2cb0d33/FLAG78c98d608 [2024-11-19 06:48:21,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3353963e2/2cd9a5982b294c7ebd3818d2c2cb0d33 [2024-11-19 06:48:21,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:48:21,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:48:21,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:48:21,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:48:21,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:48:21,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:21" (1/1) ... [2024-11-19 06:48:21,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad2e972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:21, skipping insertion in model container [2024-11-19 06:48:21,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:21" (1/1) ... [2024-11-19 06:48:21,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:48:21,803 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:21,857 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:21,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:21,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:48:21,879 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:48:21,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69063733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:21, skipping insertion in model container [2024-11-19 06:48:21,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:48:21,882 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:48:21,883 INFO L158 Benchmark]: Toolchain (without parser) took 384.38ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 96.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:48:21,884 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:48:21,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.22ms. Allocated memory is still 184.5MB. Free memory was 112.3MB in the beginning and 96.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:48:21,885 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.22ms. Allocated memory is still 184.5MB. Free memory was 112.3MB in the beginning and 96.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. 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_2.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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:48:23,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:48:23,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:48:23,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:48:23,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:48:23,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:48:23,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:48:23,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:48:23,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:48:23,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:48:23,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:48:23,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:48:23,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:48:23,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:48:23,838 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:48:23,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:48:23,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:48:23,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:48:23,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:48:23,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:48:23,839 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:48:23,840 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:48:23,840 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:48:23,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:48:23,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:48:23,841 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:48:23,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:48:23,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:48:23,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:48:23,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:48:23,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:48:23,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:48:23,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:48:23,842 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:23,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:48:23,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:48:23,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:48:23,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:48:23,844 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2024-11-19 06:48:24,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:48:24,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:48:24,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:48:24,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:48:24,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:48:24,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-19 06:48:25,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:48:26,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:48:26,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-19 06:48:26,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950f2fd20/296ecc864a544c62ac3282392405d362/FLAGeb17851dc [2024-11-19 06:48:26,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950f2fd20/296ecc864a544c62ac3282392405d362 [2024-11-19 06:48:26,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:48:26,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:48:26,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:48:26,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:48:26,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:48:26,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ecc33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26, skipping insertion in model container [2024-11-19 06:48:26,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:48:26,574 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:26,626 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:26,629 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:26,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:48:26,650 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:48:26,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:48:26,699 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:26,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:26,719 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:48:26,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:48:26,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:48:26,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:48:26,840 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:48:26,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26 WrapperNode [2024-11-19 06:48:26,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:48:26,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:48:26,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:48:26,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:48:26,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,887 INFO L138 Inliner]: procedures = 165, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 53 [2024-11-19 06:48:26,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:48:26,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:48:26,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:48:26,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:48:26,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,920 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 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-19 06:48:26,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:48:26,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:48:26,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:48:26,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:48:26,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (1/1) ... [2024-11-19 06:48:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:48:26,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:48:26,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:48:26,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:48:27,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:48:27,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:48:27,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:48:27,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:48:27,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:48:27,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:48:27,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:48:27,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:48:27,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:48:27,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:48:27,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:48:27,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:48:27,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:48:27,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:48:27,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:48:27,315 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 06:48:27,315 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:48:27,323 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:48:27,324 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:48:27,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:27 BoogieIcfgContainer [2024-11-19 06:48:27,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:48:27,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:48:27,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:48:27,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:48:27,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:48:26" (1/3) ... [2024-11-19 06:48:27,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f19d98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:48:27, skipping insertion in model container [2024-11-19 06:48:27,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:26" (2/3) ... [2024-11-19 06:48:27,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f19d98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:48:27, skipping insertion in model container [2024-11-19 06:48:27,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:27" (3/3) ... [2024-11-19 06:48:27,333 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2024-11-19 06:48:27,345 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:48:27,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-19 06:48:27,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:48:27,388 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;@6682c87c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:48:27,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 06:48:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 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-19 06:48:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:48:27,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:27,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:27,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1121226903, now seen corresponding path program 1 times [2024-11-19 06:48:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143400406] [2024-11-19 06:48:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:27,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:27,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:48:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:27,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:48:27,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:48:27,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:27,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143400406] [2024-11-19 06:48:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143400406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:27,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:48:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299884336] [2024-11-19 06:48:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:48:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:48:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:48:27,588 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 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-19 06:48:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:27,691 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2024-11-19 06:48:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:48:27,693 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-19 06:48:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:27,699 INFO L225 Difference]: With dead ends: 65 [2024-11-19 06:48:27,699 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 06:48:27,701 INFO L431 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-19 06:48:27,705 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:27,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 208 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:48:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 06:48:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2024-11-19 06:48:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 37 states have internal predecessors, (42), 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-19 06:48:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-19 06:48:27,744 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 11 [2024-11-19 06:48:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:27,744 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-19 06:48:27,745 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-19 06:48:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-19 06:48:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:48:27,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:27,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:27,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:48:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:27,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2008730584, now seen corresponding path program 1 times [2024-11-19 06:48:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433887813] [2024-11-19 06:48:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:27,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:27,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:27,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:27,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:48:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:28,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:48:28,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:48:28,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:28,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433887813] [2024-11-19 06:48:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433887813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:48:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061041137] [2024-11-19 06:48:28,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:28,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:48:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:28,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:48:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:48:28,029 INFO L87 Difference]: Start difference. First operand 42 states and 48 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-19 06:48:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:28,092 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-19 06:48:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:48:28,092 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-19 06:48:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:28,093 INFO L225 Difference]: With dead ends: 69 [2024-11-19 06:48:28,093 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 06:48:28,093 INFO L431 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-19 06:48:28,094 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:28,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:48:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 06:48:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2024-11-19 06:48:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.53125) internal successors, (49), 42 states have internal predecessors, (49), 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-19 06:48:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-19 06:48:28,099 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 11 [2024-11-19 06:48:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:28,100 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-19 06:48:28,100 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-19 06:48:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-19 06:48:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:48:28,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:28,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:28,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:48:28,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:28,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:28,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash 398308128, now seen corresponding path program 1 times [2024-11-19 06:48:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801595765] [2024-11-19 06:48:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:28,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:28,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:28,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:48:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:28,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:48:28,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:48:28,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:28,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:28,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801595765] [2024-11-19 06:48:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801595765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:28,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:28,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:48:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571152907] [2024-11-19 06:48:28,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:28,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:48:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:48:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:48:28,394 INFO L87 Difference]: Start difference. First operand 48 states and 58 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-19 06:48:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:28,448 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-19 06:48:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:48:28,449 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-19 06:48:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:28,450 INFO L225 Difference]: With dead ends: 63 [2024-11-19 06:48:28,451 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 06:48:28,451 INFO L431 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-19 06:48:28,452 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:28,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:48:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 06:48:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2024-11-19 06:48:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 43 states have internal predecessors, (50), 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-19 06:48:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-19 06:48:28,462 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 12 [2024-11-19 06:48:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-19 06:48:28,463 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-19 06:48:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-19 06:48:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:48:28,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:28,464 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:28,469 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:28,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:28,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1387011810, now seen corresponding path program 1 times [2024-11-19 06:48:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197740146] [2024-11-19 06:48:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:28,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:28,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:28,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:48:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:28,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:48:28,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:28,754 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-19 06:48:28,844 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 06:48:28,845 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-19 06:48:28,854 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-19 06:48:28,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:37,039 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-19 06:48:37,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:37,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197740146] [2024-11-19 06:48:37,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197740146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:37,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-19 06:48:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499344515] [2024-11-19 06:48:37,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:37,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:48:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:48:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2024-11-19 06:48:37,041 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-19 06:48:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:37,223 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-11-19 06:48:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:48:37,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 18 [2024-11-19 06:48:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:37,225 INFO L225 Difference]: With dead ends: 65 [2024-11-19 06:48:37,225 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 06:48:37,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2024-11-19 06:48:37,226 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:37,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:48:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 06:48:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-19 06:48:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 55 states have internal predecessors, (71), 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-19 06:48:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-11-19 06:48:37,236 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 18 [2024-11-19 06:48:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:37,236 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-11-19 06:48:37,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-19 06:48:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-11-19 06:48:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:48:37,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:37,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:37,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:48:37,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:37,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:37,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1387011811, now seen corresponding path program 1 times [2024-11-19 06:48:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:37,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577936612] [2024-11-19 06:48:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:37,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:37,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 (6)] Waiting until timeout for monitored process [2024-11-19 06:48:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:37,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:48:37,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:37,542 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-19 06:48:37,548 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-19 06:48:37,763 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-19 06:48:37,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:48:37,797 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-19 06:48:37,811 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:48:37,812 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-19 06:48:37,853 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-19 06:48:37,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:38,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577936612] [2024-11-19 06:48:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577936612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [622933478] [2024-11-19 06:48:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:48:38,116 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-19 06:48:38,126 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-19 06:48:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:38,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:48:38,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:38,220 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-19 06:48:38,227 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-19 06:48:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:48:38,385 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-19 06:48:38,401 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:48:38,401 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-19 06:48:38,434 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-19 06:48:38,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [622933478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:42,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-19 06:48:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198213416] [2024-11-19 06:48:42,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:42,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:48:42,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:42,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:48:42,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:48:42,634 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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-19 06:48:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:42,949 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-11-19 06:48:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:48:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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 18 [2024-11-19 06:48:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:42,951 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:48:42,951 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:48:42,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-19 06:48:42,952 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:42,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2024-11-19 06:48:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:48:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2024-11-19 06:48:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.530612244897959) internal successors, (75), 58 states have internal predecessors, (75), 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-19 06:48:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2024-11-19 06:48:42,959 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 18 [2024-11-19 06:48:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:42,960 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2024-11-19 06:48:42,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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-19 06:48:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-11-19 06:48:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:48:42,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:42,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:42,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-19 06:48:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:43,363 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-19 06:48:43,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 881453185, now seen corresponding path program 1 times [2024-11-19 06:48:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770519813] [2024-11-19 06:48:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:43,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:43,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:43,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:48:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:43,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:48:43,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:43,490 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-19 06:48:43,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:43,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770519813] [2024-11-19 06:48:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770519813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:48:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591854223] [2024-11-19 06:48:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:43,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:48:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:48:43,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:48:43,492 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-19 06:48:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:43,555 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-19 06:48:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:48:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2024-11-19 06:48:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:43,556 INFO L225 Difference]: With dead ends: 51 [2024-11-19 06:48:43,556 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 06:48:43,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-19 06:48:43,557 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:43,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:48:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 06:48:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 06:48:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 44 states have internal predecessors, (52), 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-19 06:48:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-19 06:48:43,564 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 18 [2024-11-19 06:48:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:43,564 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-19 06:48:43,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-19 06:48:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-19 06:48:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:48:43,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:43,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:43,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:48:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:43,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1478437295, now seen corresponding path program 1 times [2024-11-19 06:48:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:43,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066044352] [2024-11-19 06:48:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:43,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:43,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:43,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:48:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:43,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:48:43,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:43,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:43,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:43,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066044352] [2024-11-19 06:48:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066044352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:43,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:48:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560300449] [2024-11-19 06:48:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:48:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:48:43,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:48:43,872 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:48:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:43,897 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-19 06:48:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:48:43,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-19 06:48:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:43,898 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:48:43,898 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:48:43,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-19 06:48:43,899 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:43,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:48:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:48:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-19 06:48:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 46 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:48:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-19 06:48:43,902 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 20 [2024-11-19 06:48:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:43,902 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-19 06:48:43,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:48:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-19 06:48:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:48:43,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:43,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:43,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:44,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:44,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1073719666, now seen corresponding path program 1 times [2024-11-19 06:48:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:44,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352238179] [2024-11-19 06:48:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:44,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:44,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:44,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:44,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:48:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:44,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:48:44,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:48:44,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:48:44,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:44,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352238179] [2024-11-19 06:48:44,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352238179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:48:44,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:48:44,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:48:44,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724715417] [2024-11-19 06:48:44,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:48:44,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:48:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:48:44,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:48:44,170 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-19 06:48:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:44,217 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-19 06:48:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:48:44,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 20 [2024-11-19 06:48:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:44,218 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:48:44,218 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:48:44,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:48:44,219 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:44,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:48:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:48:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-19 06:48:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 48 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:48:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-19 06:48:44,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 20 [2024-11-19 06:48:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:44,222 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-19 06:48:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-19 06:48:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-11-19 06:48:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:48:44,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:44,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:44,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:48:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:44,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:44,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1073719716, now seen corresponding path program 1 times [2024-11-19 06:48:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144355796] [2024-11-19 06:48:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:44,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:44,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:44,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:48:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:44,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:48:44,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:44,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:44,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144355796] [2024-11-19 06:48:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144355796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:44,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-19 06:48:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453479649] [2024-11-19 06:48:44,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:44,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:48:44,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:48:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:48:44,581 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 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-19 06:48:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:44,624 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-19 06:48:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:48:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 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 20 [2024-11-19 06:48:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:44,625 INFO L225 Difference]: With dead ends: 55 [2024-11-19 06:48:44,625 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 06:48:44,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-19 06:48:44,626 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:44,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:48:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 06:48:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-19 06:48:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.4) internal successors, (56), 47 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:48:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-19 06:48:44,629 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 20 [2024-11-19 06:48:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:44,630 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-19 06:48:44,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 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-19 06:48:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-19 06:48:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:48:44,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:44,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:44,635 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:44,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:44,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1074427268, now seen corresponding path program 1 times [2024-11-19 06:48:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688298677] [2024-11-19 06:48:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:44,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:44,834 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:44,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:48:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:44,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:48:44,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:45,043 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-19 06:48:45,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:45,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688298677] [2024-11-19 06:48:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688298677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:45,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-19 06:48:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077741037] [2024-11-19 06:48:45,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:48:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:48:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:48:45,123 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:48:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:45,280 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-19 06:48:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:48:45,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-11-19 06:48:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:45,281 INFO L225 Difference]: With dead ends: 58 [2024-11-19 06:48:45,281 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:48:45,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:48:45,282 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:45,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:48:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:48:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-19 06:48:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 47 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 06:48:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-19 06:48:45,285 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 21 [2024-11-19 06:48:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:45,286 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-19 06:48:45,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:48:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-19 06:48:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:48:45,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:45,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:45,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:48:45,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:45,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:45,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -807401739, now seen corresponding path program 1 times [2024-11-19 06:48:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893611995] [2024-11-19 06:48:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:45,490 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:45,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:48:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:45,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:48:45,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:45,639 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-19 06:48:45,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:45,704 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-19 06:48:45,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893611995] [2024-11-19 06:48:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893611995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:45,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:48:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406004045] [2024-11-19 06:48:45,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:45,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:48:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:48:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:48:45,707 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-19 06:48:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:45,817 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2024-11-19 06:48:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:48:45,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 22 [2024-11-19 06:48:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:45,818 INFO L225 Difference]: With dead ends: 76 [2024-11-19 06:48:45,818 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 06:48:45,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 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-19 06:48:45,818 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:45,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 116 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:48:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 06:48:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-19 06:48:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 61 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-19 06:48:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2024-11-19 06:48:45,822 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 22 [2024-11-19 06:48:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:45,822 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-11-19 06:48:45,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-19 06:48:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-11-19 06:48:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:48:45,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:45,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:45,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:48:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:46,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2128418719, now seen corresponding path program 1 times [2024-11-19 06:48:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929437542] [2024-11-19 06:48:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:46,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:46,027 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:46,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:48:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:46,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:48:46,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:46,218 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.base_23| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_23| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_23|)))) is different from true [2024-11-19 06:48:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:46,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:46,303 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-19 06:48:46,304 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 43 treesize of output 38 [2024-11-19 06:48:46,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929437542] [2024-11-19 06:48:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929437542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191341350] [2024-11-19 06:48:46,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:46,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:46,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:48:46,431 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-19 06:48:46,436 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-19 06:48:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:46,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:48:46,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:46,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:46,829 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-19 06:48:46,829 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 43 treesize of output 38 [2024-11-19 06:48:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1191341350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:46,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:46,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-19 06:48:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762119853] [2024-11-19 06:48:46,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:48:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:48:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:48:46,953 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (4), 1 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-19 06:48:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:47,263 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2024-11-19 06:48:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:48:47,264 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (4), 1 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 24 [2024-11-19 06:48:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:47,265 INFO L225 Difference]: With dead ends: 109 [2024-11-19 06:48:47,265 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 06:48:47,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-19 06:48:47,266 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 71 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:47,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 150 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2024-11-19 06:48:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 06:48:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2024-11-19 06:48:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 79 states have internal predecessors, (100), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 06:48:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 123 transitions. [2024-11-19 06:48:47,270 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 123 transitions. Word has length 24 [2024-11-19 06:48:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:47,270 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 123 transitions. [2024-11-19 06:48:47,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (4), 1 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-19 06:48:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2024-11-19 06:48:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:48:47,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:47,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:47,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:47,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:48:47,672 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-19 06:48:47,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:47,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1844216072, now seen corresponding path program 1 times [2024-11-19 06:48:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:47,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541045478] [2024-11-19 06:48:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:47,675 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:47,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:48:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:47,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 06:48:47,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:47,756 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-19 06:48:47,761 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-19 06:48:47,895 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-19 06:48:47,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:48:47,916 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-19 06:48:47,932 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:48:47,933 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-19 06:48:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:48:48,101 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-19 06:48:48,115 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:48:48,115 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-19 06:48:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-19 06:48:48,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:48,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:48,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541045478] [2024-11-19 06:48:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541045478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:48,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1019977382] [2024-11-19 06:48:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:48,399 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:48,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:48:48,402 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:48:48,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-19 06:48:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:48,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 06:48:48,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:48,516 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-19 06:48:48,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 7 [2024-11-19 06:48:48,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:48:48,641 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-19 06:48:48,657 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:48:48,658 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-19 06:48:48,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:48:48,798 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-19 06:48:48,814 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:48:48,815 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-19 06:48:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-19 06:48:48,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1019977382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:48:49,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-19 06:48:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371637997] [2024-11-19 06:48:49,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:49,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:48:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:49,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:48:49,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-19 06:48:49,003 INFO L87 Difference]: Start difference. First operand 94 states and 123 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 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-19 06:48:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:49,370 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2024-11-19 06:48:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:48:49,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 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 28 [2024-11-19 06:48:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:49,371 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:48:49,371 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:48:49,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=313, Unknown=1, NotChecked=36, Total=420 [2024-11-19 06:48:49,372 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:49,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 189 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2024-11-19 06:48:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:48:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-19 06:48:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 79 states have internal predecessors, (98), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 06:48:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2024-11-19 06:48:49,377 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 28 [2024-11-19 06:48:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:49,378 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2024-11-19 06:48:49,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 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-19 06:48:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2024-11-19 06:48:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:48:49,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:49,379 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:49,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:48:49,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-19 06:48:49,779 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 06:48:49,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:49,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1022360221, now seen corresponding path program 1 times [2024-11-19 06:48:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789945636] [2024-11-19 06:48:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:49,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:49,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:49,782 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:49,783 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 (18)] Waiting until timeout for monitored process [2024-11-19 06:48:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:49,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:48:49,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:49,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:50,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 06:48:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:48:50,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789945636] [2024-11-19 06:48:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789945636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:50,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-19 06:48:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215932199] [2024-11-19 06:48:50,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:50,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:48:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:48:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:48:50,538 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:48:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:51,210 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-11-19 06:48:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:48:51,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-11-19 06:48:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:51,216 INFO L225 Difference]: With dead ends: 122 [2024-11-19 06:48:51,216 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 06:48:51,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:48:51,216 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:51,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 247 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:48:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 06:48:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2024-11-19 06:48:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 79 states have internal predecessors, (97), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 06:48:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2024-11-19 06:48:51,230 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 30 [2024-11-19 06:48:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:51,230 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2024-11-19 06:48:51,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:48:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2024-11-19 06:48:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:48:51,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:51,231 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:51,242 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 (18)] Ended with exit code 0 [2024-11-19 06:48:51,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:51,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:51,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1628395789, now seen corresponding path program 1 times [2024-11-19 06:48:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823492781] [2024-11-19 06:48:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:51,436 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-19 06:48:51,437 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-19 06:48:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:51,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:48:51,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:51,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:48:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:48:51,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:51,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:51,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823492781] [2024-11-19 06:48:51,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823492781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:51,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:51,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-19 06:48:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682619527] [2024-11-19 06:48:51,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:51,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:48:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:51,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:48:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:48:51,882 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:48:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:48:52,532 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2024-11-19 06:48:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:48:52,533 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-11-19 06:48:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:48:52,534 INFO L225 Difference]: With dead ends: 115 [2024-11-19 06:48:52,534 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:48:52,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:48:52,535 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:48:52,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 316 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:48:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:48:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2024-11-19 06:48:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.271604938271605) internal successors, (103), 85 states have internal predecessors, (103), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 06:48:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-11-19 06:48:52,539 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 31 [2024-11-19 06:48:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:48:52,539 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-11-19 06:48:52,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:48:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-11-19 06:48:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:48:52,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:48:52,540 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:48:52,543 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 (19)] Ended with exit code 0 [2024-11-19 06:48:52,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-19 06:48:52,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:48:52,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:48:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1059338178, now seen corresponding path program 1 times [2024-11-19 06:48:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:48:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912727996] [2024-11-19 06:48:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:48:52,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:48:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:48:52,744 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:48:52,745 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 (20)] Waiting until timeout for monitored process [2024-11-19 06:48:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:48:52,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 06:48:52,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:48:53,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:48:53,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:48:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:48:53,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:48:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:48:54,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:48:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912727996] [2024-11-19 06:48:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912727996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:48:54,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:48:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 21 [2024-11-19 06:48:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842548887] [2024-11-19 06:48:54,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:48:54,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:48:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:48:54,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:48:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:48:54,120 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:48:58,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:02,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:04,900 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2024-11-19 06:49:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 06:49:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2024-11-19 06:49:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:04,903 INFO L225 Difference]: With dead ends: 113 [2024-11-19 06:49:04,903 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 06:49:04,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 06:49:04,904 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 90 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:04,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 191 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 473 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-19 06:49:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 06:49:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-11-19 06:49:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 86 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 06:49:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2024-11-19 06:49:04,910 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 32 [2024-11-19 06:49:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:04,910 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2024-11-19 06:49:04,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:49:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2024-11-19 06:49:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:49:04,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:04,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:04,916 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 (20)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:05,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:05,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:49:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1520254763, now seen corresponding path program 1 times [2024-11-19 06:49:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672367120] [2024-11-19 06:49:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:05,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:05,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:05,117 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-19 06:49:05,117 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-19 06:49:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:05,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 06:49:05,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:05,269 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-19 06:49:05,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:49:05,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-19 06:49:05,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:49:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:49:05,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:49:05,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:05,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672367120] [2024-11-19 06:49:05,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672367120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:49:05,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:05,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-19 06:49:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815342377] [2024-11-19 06:49:05,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:05,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 06:49:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 06:49:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:49:05,974 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:49:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:07,844 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2024-11-19 06:49:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 06:49:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2024-11-19 06:49:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:07,847 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:49:07,848 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 06:49:07,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:49:07,849 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:07,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 321 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 06:49:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 06:49:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 125. [2024-11-19 06:49:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 107 states have internal predecessors, (131), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2024-11-19 06:49:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2024-11-19 06:49:07,856 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 33 [2024-11-19 06:49:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:07,857 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-11-19 06:49:07,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:49:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2024-11-19 06:49:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:49:07,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:07,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:07,867 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 (21)] Ended with exit code 0 [2024-11-19 06:49:08,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-19 06:49:08,059 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:49:08,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1308903850, now seen corresponding path program 2 times [2024-11-19 06:49:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116575515] [2024-11-19 06:49:08,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:49:08,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:08,063 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:08,065 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 (22)] Waiting until timeout for monitored process [2024-11-19 06:49:08,135 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:49:08,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:49:08,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:49:08,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:49:08,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:08,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116575515] [2024-11-19 06:49:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116575515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:49:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423709852] [2024-11-19 06:49:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:08,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:49:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:08,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:49:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:49:08,223 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:08,257 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-19 06:49:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:49:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-19 06:49:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:08,258 INFO L225 Difference]: With dead ends: 82 [2024-11-19 06:49:08,258 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 06:49:08,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-19 06:49:08,259 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 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-19 06:49:08,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 06:49:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-19 06:49:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.206896551724138) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:49:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-19 06:49:08,266 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2024-11-19 06:49:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-19 06:49:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-19 06:49:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:49:08,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:08,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:08,272 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 (22)] Ended with exit code 0 [2024-11-19 06:49:08,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:08,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:49:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 520579815, now seen corresponding path program 1 times [2024-11-19 06:49:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40519319] [2024-11-19 06:49:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:08,475 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-19 06:49:08,476 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-19 06:49:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:08,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:49:08,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:49:08,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:49:08,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40519319] [2024-11-19 06:49:08,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40519319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:49:08,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:08,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-19 06:49:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900943010] [2024-11-19 06:49:08,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:08,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:49:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:49:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:08,726 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:49:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:08,879 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-19 06:49:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:49:08,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2024-11-19 06:49:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:08,881 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:49:08,881 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:49:08,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:08,881 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:08,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 154 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:49:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:49:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 06:49:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.1875) internal successors, (76), 70 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:49:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-19 06:49:08,886 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 36 [2024-11-19 06:49:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:08,886 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-19 06:49:08,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:49:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-19 06:49:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:49:08,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:08,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:08,893 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 (23)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:09,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:09,090 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:49:09,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:09,090 INFO L85 PathProgramCache]: Analyzing trace with hash -159020851, now seen corresponding path program 2 times [2024-11-19 06:49:09,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:09,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269617662] [2024-11-19 06:49:09,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:49:09,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:09,095 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:09,096 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 (24)] Waiting until timeout for monitored process [2024-11-19 06:49:09,173 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:49:09,173 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:49:09,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:49:09,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:09,207 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-19 06:49:09,213 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-19 06:49:09,398 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-19 06:49:09,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:09,423 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-19 06:49:09,443 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:49:09,443 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-19 06:49:09,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:09,623 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-19 06:49:09,639 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:49:09,639 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-19 06:49:09,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:09,782 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-19 06:49:09,793 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:49:09,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-19 06:49:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-19 06:49:09,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:10,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269617662] [2024-11-19 06:49:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269617662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:49:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758076282] [2024-11-19 06:49:10,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:49:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:49:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:49:10,144 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:49:10,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-19 06:49:10,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:49:10,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:49:10,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:49:10,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:10,306 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-19 06:49:10,313 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-19 06:49:10,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:10,397 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-19 06:49:10,411 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:49:10,411 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-19 06:49:10,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:10,505 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-19 06:49:10,518 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:49:10,519 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-19 06:49:10,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:10,629 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-19 06:49:10,644 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:49:10,645 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-19 06:49:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-19 06:49:10,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1758076282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:49:10,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:10,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-19 06:49:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195510435] [2024-11-19 06:49:10,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:10,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:49:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:10,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:49:10,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:49:10,854 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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-19 06:49:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:11,525 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-19 06:49:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:49:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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 38 [2024-11-19 06:49:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:11,526 INFO L225 Difference]: With dead ends: 84 [2024-11-19 06:49:11,526 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 06:49:11,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2024-11-19 06:49:11,527 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 55 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:11,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 256 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 312 Invalid, 0 Unknown, 69 Unchecked, 0.4s Time] [2024-11-19 06:49:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 06:49:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-19 06:49:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.171875) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:49:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-11-19 06:49:11,531 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 38 [2024-11-19 06:49:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:11,531 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-11-19 06:49:11,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 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-19 06:49:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-11-19 06:49:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:49:11,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:11,532 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:11,536 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 (24)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:11,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:11,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 06:49:11,938 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:49:11,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2060951864, now seen corresponding path program 1 times [2024-11-19 06:49:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202512974] [2024-11-19 06:49:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:11,941 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:11,942 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 (26)] Waiting until timeout for monitored process [2024-11-19 06:49:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:12,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:49:12,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:12,017 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-19 06:49:12,145 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 06:49:12,145 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-19 06:49:12,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:49:12,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:49:16,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 06:49:16,565 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 16 treesize of output 13 [2024-11-19 06:49:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:16,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:21,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202512974] [2024-11-19 06:49:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202512974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:49:21,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-19 06:49:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036036572] [2024-11-19 06:49:21,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:49:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:49:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=522, Unknown=2, NotChecked=0, Total=600 [2024-11-19 06:49:21,531 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:49:25,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:29,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:33,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:38,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:42,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:46,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:49:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:47,208 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-19 06:49:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:49:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2024-11-19 06:49:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:47,209 INFO L225 Difference]: With dead ends: 91 [2024-11-19 06:49:47,209 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 06:49:47,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=132, Invalid=988, Unknown=2, NotChecked=0, Total=1122 [2024-11-19 06:49:47,210 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:47,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 6 Unknown, 0 Unchecked, 25.1s Time] [2024-11-19 06:49:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 06:49:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-19 06:49:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.2) internal successors, (84), 76 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-19 06:49:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-19 06:49:47,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 38 [2024-11-19 06:49:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:47,213 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-19 06:49:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:49:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-19 06:49:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:49:47,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:47,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:47,220 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 (26)] Ended with exit code 0 [2024-11-19 06:49:47,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:47,418 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-19 06:49:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 594821051, now seen corresponding path program 1 times [2024-11-19 06:49:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689202068] [2024-11-19 06:49:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:47,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:47,421 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:47,422 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 (27)] Waiting until timeout for monitored process [2024-11-19 06:49:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:47,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:49:47,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:47,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:49:48,217 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-19 06:49:48,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-11-19 06:49:48,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 38 treesize of output 22 [2024-11-19 06:49:52,899 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_#t~mem45#1.base_19| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ BitVec 32))) (and (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_#t~mem45#1.base_19| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_#t~mem45#1.base_19|) (_ bv0 1)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ bv0 32))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_32|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ bv1 1)) |v_ULTIMATE.start_entry_point_#t~mem45#1.base_19| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_32|))))) is different from true [2024-11-19 06:49:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:49:52,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:53,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22