./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:44:27,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:44:27,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:44:27,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:44:27,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:44:27,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:44:27,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:44:27,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:44:27,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:44:27,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:44:27,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:44:27,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:44:27,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:44:27,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:44:27,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:44:27,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:44:27,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:44:27,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:44:27,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:44:27,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:44:27,296 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:44:27,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:44:27,296 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:44:27,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:44:27,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:44:27,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:44:27,297 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:44:27,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:44:27,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:44:27,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:44:27,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:44:27,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:44:27,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:44:27,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:44:27,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:44:27,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:44:27,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:44:27,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:44:27,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:44:27,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:44:27,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:44:27,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:44:27,303 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2024-11-20 14:44:27,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:44:27,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:44:27,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:44:27,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:44:27,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:44:27,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-20 14:44:29,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:44:29,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:44:29,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-20 14:44:29,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a0fd6e8/a218fb55fe0a4f009263550b25e98b03/FLAG490546e4c [2024-11-20 14:44:29,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42a0fd6e8/a218fb55fe0a4f009263550b25e98b03 [2024-11-20 14:44:29,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:44:29,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:44:29,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:44:29,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:44:29,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:44:29,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:44:29" (1/1) ... [2024-11-20 14:44:29,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8c5889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:29, skipping insertion in model container [2024-11-20 14:44:29,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:44:29" (1/1) ... [2024-11-20 14:44:29,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:44:30,091 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-20 14:44:30,161 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-20 14:44:30,174 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-20 14:44:30,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:44:30,201 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-20 14:44:30,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42b5d896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:30, skipping insertion in model container [2024-11-20 14:44:30,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:44:30,205 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 14:44:30,207 INFO L158 Benchmark]: Toolchain (without parser) took 528.44ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 112.2MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 14:44:30,207 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 125.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:44:30,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.24ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 112.2MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 14:44:30,210 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.81ms. Allocated memory is still 125.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.24ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 112.2MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-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 bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:44:32,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:44:32,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 14:44:32,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:44:32,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:44:32,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:44:32,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:44:32,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:44:32,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:44:32,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:44:32,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:44:32,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:44:32,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:44:32,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:44:32,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:44:32,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:44:32,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:44:32,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:44:32,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:44:32,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:44:32,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:44:32,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:44:32,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:44:32,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:44:32,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:44:32,517 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 14:44:32,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:44:32,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 14:44:32,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:44:32,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:44:32,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:44:32,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:44:32,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:44:32,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:44:32,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:44:32,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:44:32,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:44:32,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:44:32,521 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 14:44:32,521 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 14:44:32,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:44:32,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:44:32,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:44:32,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:44:32,523 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 -> bb0a504b43b0de742fcc89ebbe9d313056bb1824edece6c56238a649b6f48626 [2024-11-20 14:44:32,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:44:32,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:44:32,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:44:32,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:44:32,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:44:32,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-20 14:44:34,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:44:34,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:44:34,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2024-11-20 14:44:34,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12759fb0/b236739ee76549d581a10440d3c7b778/FLAG0663b90b1 [2024-11-20 14:44:34,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12759fb0/b236739ee76549d581a10440d3c7b778 [2024-11-20 14:44:34,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:44:34,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:44:34,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:44:34,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:44:34,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:44:34,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:44:34" (1/1) ... [2024-11-20 14:44:34,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a24eacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:34, skipping insertion in model container [2024-11-20 14:44:34,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:44:34" (1/1) ... [2024-11-20 14:44:34,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:44:35,343 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:44:35,414 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-20 14:44:35,420 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-20 14:44:35,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:44:35,452 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 14:44:35,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:44:35,490 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:44:35,512 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-20 14:44:35,515 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-20 14:44:35,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:44:35,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:44:35,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:44:35,634 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:44:35,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35 WrapperNode [2024-11-20 14:44:35,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:44:35,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:44:35,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:44:35,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:44:35,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,701 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 24, calls inlined = 6, statements flattened = 99 [2024-11-20 14:44:35,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:44:35,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:44:35,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:44:35,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:44:35,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,762 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-20 14:44:35,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:44:35,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:44:35,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:44:35,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:44:35,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (1/1) ... [2024-11-20 14:44:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:44:35,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:44:35,835 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-20 14:44:35,838 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-20 14:44:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-20 14:44:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-20 14:44:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:44:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:44:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:44:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:44:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:44:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:44:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:44:35,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:44:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:44:35,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:44:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:44:36,054 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:44:36,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:44:36,456 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-20 14:44:36,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:44:36,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:44:36,476 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 14:44:36,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:44:36 BoogieIcfgContainer [2024-11-20 14:44:36,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:44:36,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:44:36,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:44:36,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:44:36,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:44:34" (1/3) ... [2024-11-20 14:44:36,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1317d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:44:36, skipping insertion in model container [2024-11-20 14:44:36,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:44:35" (2/3) ... [2024-11-20 14:44:36,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1317d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:44:36, skipping insertion in model container [2024-11-20 14:44:36,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:44:36" (3/3) ... [2024-11-20 14:44:36,489 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2024-11-20 14:44:36,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:44:36,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-20 14:44:36,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:44:36,556 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;@17349809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:44:36,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-20 14:44:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 63 states have internal predecessors, (76), 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-20 14:44:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:44:36,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:36,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:36,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:36,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash 858994893, now seen corresponding path program 1 times [2024-11-20 14:44:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:36,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964948909] [2024-11-20 14:44:36,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:36,590 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-20 14:44:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:36,592 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-20 14:44:36,593 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-20 14:44:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:36,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 14:44:36,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:36,710 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-20 14:44:36,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:36,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964948909] [2024-11-20 14:44:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964948909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:44:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989431686] [2024-11-20 14:44:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:36,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 14:44:36,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:36,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 14:44:36,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:44:36,749 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 63 states have internal predecessors, (76), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-20 14:44:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:36,774 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-20 14:44:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 14:44:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2024-11-20 14:44:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:36,784 INFO L225 Difference]: With dead ends: 67 [2024-11-20 14:44:36,785 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 14:44:36,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:44:36,794 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:36,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:44:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 14:44:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-20 14:44:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 61 states have internal predecessors, (69), 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-20 14:44:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-11-20 14:44:36,857 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 14 [2024-11-20 14:44:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:36,857 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-11-20 14:44:36,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-20 14:44:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-11-20 14:44:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:44:36,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:36,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:36,869 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-20 14:44:37,064 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-20 14:44:37,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 465967883, now seen corresponding path program 1 times [2024-11-20 14:44:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286456564] [2024-11-20 14:44:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:37,067 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-20 14:44:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:37,069 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-20 14:44:37,070 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-20 14:44:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:37,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:44:37,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:37,231 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-20 14:44:37,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:37,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286456564] [2024-11-20 14:44:37,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286456564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:44:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931556828] [2024-11-20 14:44:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:37,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:44:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:37,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:44:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:44:37,236 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:37,358 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2024-11-20 14:44:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:44:37,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-20 14:44:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:37,361 INFO L225 Difference]: With dead ends: 115 [2024-11-20 14:44:37,361 INFO L226 Difference]: Without dead ends: 115 [2024-11-20 14:44:37,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-20 14:44:37,365 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 50 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:37,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 316 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:44:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-20 14:44:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2024-11-20 14:44:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6) internal successors, (72), 64 states have internal predecessors, (72), 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-20 14:44:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-11-20 14:44:37,383 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2024-11-20 14:44:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:37,384 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-11-20 14:44:37,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-11-20 14:44:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:44:37,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:37,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:37,388 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-20 14:44:37,585 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-20 14:44:37,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:37,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 465866789, now seen corresponding path program 1 times [2024-11-20 14:44:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:37,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928015915] [2024-11-20 14:44:37,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:37,588 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-20 14:44:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:37,590 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-20 14:44:37,591 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-20 14:44:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:37,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:44:37,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:37,703 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-20 14:44:37,760 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-20 14:44:37,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:37,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928015915] [2024-11-20 14:44:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928015915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:44:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602049078] [2024-11-20 14:44:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:44:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:44:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:44:37,792 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:37,958 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2024-11-20 14:44:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:44:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-20 14:44:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:37,960 INFO L225 Difference]: With dead ends: 91 [2024-11-20 14:44:37,960 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 14:44:37,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-20 14:44:37,961 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:37,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:44:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 14:44:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2024-11-20 14:44:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 75 states have internal predecessors, (89), 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-20 14:44:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-11-20 14:44:37,975 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 14 [2024-11-20 14:44:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:37,975 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-11-20 14:44:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-11-20 14:44:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:44:37,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:37,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:37,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 14:44:38,180 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-20 14:44:38,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:38,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:38,181 INFO L85 PathProgramCache]: Analyzing trace with hash 465866790, now seen corresponding path program 1 times [2024-11-20 14:44:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009750089] [2024-11-20 14:44:38,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:38,182 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-20 14:44:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:38,185 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-20 14:44:38,190 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-20 14:44:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:38,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 14:44:38,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:38,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-20 14:44:38,613 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-20 14:44:38,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:38,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009750089] [2024-11-20 14:44:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009750089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:38,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:38,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:44:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251812340] [2024-11-20 14:44:38,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:38,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:44:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:44:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:44:38,616 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-20 14:44:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:38,949 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2024-11-20 14:44:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:44:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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 14 [2024-11-20 14:44:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:38,950 INFO L225 Difference]: With dead ends: 92 [2024-11-20 14:44:38,951 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 14:44:38,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:44:38,952 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:38,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 357 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:44:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 14:44:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-11-20 14:44:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 77 states have internal predecessors, (91), 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-20 14:44:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-20 14:44:38,966 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 14 [2024-11-20 14:44:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-20 14:44:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-20 14:44:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-20 14:44:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:44:38,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:38,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:38,971 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-20 14:44:39,168 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-20 14:44:39,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:39,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:39,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1353471564, now seen corresponding path program 1 times [2024-11-20 14:44:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:39,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339190832] [2024-11-20 14:44:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:39,170 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-20 14:44:39,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:39,171 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-20 14:44:39,172 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-20 14:44:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:39,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:44:39,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:39,246 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-20 14:44:39,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:39,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:39,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339190832] [2024-11-20 14:44:39,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339190832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:39,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:44:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540652962] [2024-11-20 14:44:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:39,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:44:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:39,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:44:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:44:39,249 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:39,345 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2024-11-20 14:44:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:44:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-20 14:44:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:39,347 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:44:39,348 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 14:44:39,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-20 14:44:39,349 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:39,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 200 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:44:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 14:44:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 82. [2024-11-20 14:44:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 77 states have internal predecessors, (90), 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-20 14:44:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-20 14:44:39,357 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 14 [2024-11-20 14:44:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:39,357 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-20 14:44:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-20 14:44:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:44:39,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:39,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:39,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 14:44:39,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:44:39,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:39,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1353370470, now seen corresponding path program 1 times [2024-11-20 14:44:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778712365] [2024-11-20 14:44:39,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:39,563 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-20 14:44:39,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:39,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:44:39,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 14:44:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:39,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:44:39,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:39,678 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-20 14:44:39,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:39,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778712365] [2024-11-20 14:44:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778712365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:39,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:39,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:44:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241527068] [2024-11-20 14:44:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:39,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:44:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:44:39,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:44:39,684 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:39,722 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-11-20 14:44:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:44:39,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-11-20 14:44:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:39,723 INFO L225 Difference]: With dead ends: 78 [2024-11-20 14:44:39,723 INFO L226 Difference]: Without dead ends: 76 [2024-11-20 14:44:39,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-20 14:44:39,724 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:39,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:44:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-20 14:44:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-20 14:44:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:44:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-20 14:44:39,736 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 14 [2024-11-20 14:44:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:39,737 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-20 14:44:39,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-20 14:44:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-20 14:44:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:44:39,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:39,737 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:39,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 14:44:39,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:44:39,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:39,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1598186502, now seen corresponding path program 1 times [2024-11-20 14:44:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128690269] [2024-11-20 14:44:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:39,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-20 14:44:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:39,940 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-20 14:44:39,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 (8)] Waiting until timeout for monitored process [2024-11-20 14:44:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:40,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 14:44:40,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:40,050 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-20 14:44:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:40,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:41,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128690269] [2024-11-20 14:44:41,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128690269] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:44:41,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:44:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-11-20 14:44:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705682804] [2024-11-20 14:44:41,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:44:41,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 14:44:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 14:44:41,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-20 14:44:41,403 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-20 14:44:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:43,120 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-20 14:44:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:44:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 17 [2024-11-20 14:44:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:43,122 INFO L225 Difference]: With dead ends: 93 [2024-11-20 14:44:43,122 INFO L226 Difference]: Without dead ends: 93 [2024-11-20 14:44:43,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2024-11-20 14:44:43,130 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 166 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:43,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 571 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 14:44:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-20 14:44:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-20 14:44:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 81 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:44:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-20 14:44:43,140 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 17 [2024-11-20 14:44:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:43,141 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-20 14:44:43,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-20 14:44:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-20 14:44:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:44:43,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:43,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:43,149 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 (8)] Forceful destruction successful, exit code 0 [2024-11-20 14:44:43,345 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-20 14:44:43,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 740047555, now seen corresponding path program 1 times [2024-11-20 14:44:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680477948] [2024-11-20 14:44:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:43,347 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-20 14:44:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:43,349 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-20 14:44:43,350 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-20 14:44:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:43,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:44:43,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:43,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 14:44:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:44:43,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:43,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680477948] [2024-11-20 14:44:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680477948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:44:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428803413] [2024-11-20 14:44:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:43,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:44:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:44:43,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:44:43,468 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-20 14:44:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:43,619 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-11-20 14:44:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:44:43,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2024-11-20 14:44:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:43,621 INFO L225 Difference]: With dead ends: 95 [2024-11-20 14:44:43,621 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 14:44:43,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:44:43,622 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:43,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 212 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:44:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 14:44:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2024-11-20 14:44:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 82 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:44:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-20 14:44:43,633 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 22 [2024-11-20 14:44:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:43,633 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-20 14:44:43,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-20 14:44:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-20 14:44:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:44:43,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:43,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:43,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 14:44:43,834 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-20 14:44:43,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 740047556, now seen corresponding path program 1 times [2024-11-20 14:44:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320952912] [2024-11-20 14:44:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:44:43,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:43,837 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-20 14:44:43,838 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-20 14:44:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:43,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:44:43,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:43,946 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-20 14:44:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:44,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:44,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320952912] [2024-11-20 14:44:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320952912] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 14:44:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:44:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-11-20 14:44:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103924943] [2024-11-20 14:44:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:44,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:44:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:44:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:44:44,960 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-20 14:44:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:45,776 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2024-11-20 14:44:45,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:44:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2024-11-20 14:44:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:45,779 INFO L225 Difference]: With dead ends: 139 [2024-11-20 14:44:45,780 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 14:44:45,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:44:45,781 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 117 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:45,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 257 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:44:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 14:44:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2024-11-20 14:44:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.507936507936508) internal successors, (95), 82 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:44:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-20 14:44:45,795 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 22 [2024-11-20 14:44:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:45,796 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-20 14:44:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-20 14:44:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-20 14:44:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 14:44:45,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:45,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:45,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 14:44:45,997 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-20 14:44:45,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:45,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1466636327, now seen corresponding path program 1 times [2024-11-20 14:44:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507060340] [2024-11-20 14:44:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:45,999 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-20 14:44:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:46,000 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-20 14:44:46,001 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-20 14:44:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:46,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:44:46,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:44:46,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:46,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507060340] [2024-11-20 14:44:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507060340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:44:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597902496] [2024-11-20 14:44:46,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:46,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:44:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:44:46,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:44:46,091 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-20 14:44:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:46,124 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2024-11-20 14:44:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:44:46,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2024-11-20 14:44:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:46,125 INFO L225 Difference]: With dead ends: 85 [2024-11-20 14:44:46,125 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 14:44:46,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-20 14:44:46,126 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:46,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 200 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:44:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 14:44:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 14:44:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 14:44:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-11-20 14:44:46,131 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 23 [2024-11-20 14:44:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:46,131 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-11-20 14:44:46,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-20 14:44:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-11-20 14:44:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 14:44:46,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:46,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:46,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-20 14:44:46,333 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-20 14:44:46,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1466637803, now seen corresponding path program 1 times [2024-11-20 14:44:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502674786] [2024-11-20 14:44:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:46,334 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-20 14:44:46,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:46,335 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-20 14:44:46,336 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-20 14:44:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:46,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 14:44:46,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:46,419 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-20 14:44:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:46,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:46,506 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 14 treesize of output 12 [2024-11-20 14:44:46,510 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 18 treesize of output 16 [2024-11-20 14:44:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:46,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502674786] [2024-11-20 14:44:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502674786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:44:46,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:44:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 14:44:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671083608] [2024-11-20 14:44:46,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:44:46,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:44:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:44:46,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:44:46,535 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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-20 14:44:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:46,760 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2024-11-20 14:44:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:44:46,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 23 [2024-11-20 14:44:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:46,761 INFO L225 Difference]: With dead ends: 129 [2024-11-20 14:44:46,762 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 14:44:46,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:44:46,762 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:46,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 364 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:44:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 14:44:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2024-11-20 14:44:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 96 states have internal predecessors, (120), 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-20 14:44:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-11-20 14:44:46,768 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 23 [2024-11-20 14:44:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:46,769 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-11-20 14:44:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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-20 14:44:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-11-20 14:44:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:44:46,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:46,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:46,774 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-20 14:44:46,973 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-20 14:44:46,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1778913965, now seen corresponding path program 1 times [2024-11-20 14:44:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560981219] [2024-11-20 14:44:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:46,974 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-20 14:44:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:46,975 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-20 14:44:46,977 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-20 14:44:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:47,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:44:47,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:44:47,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:44:47,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560981219] [2024-11-20 14:44:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560981219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:44:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:44:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:44:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922121182] [2024-11-20 14:44:47,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:44:47,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:44:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:47,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:44:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:44:47,163 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-20 14:44:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:47,253 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2024-11-20 14:44:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:44:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 24 [2024-11-20 14:44:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:47,255 INFO L225 Difference]: With dead ends: 100 [2024-11-20 14:44:47,255 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 14:44:47,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:44:47,256 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 45 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:47,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 159 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:44:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 14:44:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-20 14:44:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 95 states have internal predecessors, (118), 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-20 14:44:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2024-11-20 14:44:47,260 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 24 [2024-11-20 14:44:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:47,260 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2024-11-20 14:44:47,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-20 14:44:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2024-11-20 14:44:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:44:47,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:47,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:47,268 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-20 14:44:47,462 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-20 14:44:47,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:47,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1778868221, now seen corresponding path program 1 times [2024-11-20 14:44:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:47,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618969836] [2024-11-20 14:44:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:47,463 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-20 14:44:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:47,464 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-20 14:44:47,465 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-20 14:44:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:47,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:44:47,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:47,571 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-20 14:44:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:47,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:47,751 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 14 treesize of output 12 [2024-11-20 14:44:47,753 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 22 treesize of output 20 [2024-11-20 14:44:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:47,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:47,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618969836] [2024-11-20 14:44:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618969836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:44:47,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:44:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-20 14:44:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281604302] [2024-11-20 14:44:47,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:44:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:44:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:44:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:44:47,800 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:44:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:48,196 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2024-11-20 14:44:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:44:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-20 14:44:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:48,199 INFO L225 Difference]: With dead ends: 126 [2024-11-20 14:44:48,199 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 14:44:48,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:44:48,200 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 149 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:48,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:44:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 14:44:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2024-11-20 14:44:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.5) internal successors, (120), 97 states have internal predecessors, (120), 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-20 14:44:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2024-11-20 14:44:48,207 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 128 transitions. Word has length 24 [2024-11-20 14:44:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:48,207 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 128 transitions. [2024-11-20 14:44:48,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:44:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2024-11-20 14:44:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:44:48,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:48,210 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:48,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 14:44:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:44:48,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:48,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash -878858933, now seen corresponding path program 1 times [2024-11-20 14:44:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008039703] [2024-11-20 14:44:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:48,414 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-20 14:44:48,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:48,416 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:44:48,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 14:44:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:48,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 14:44:48,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:48,489 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-20 14:44:48,551 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-20 14:44:48,572 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-20 14:44:48,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-20 14:44:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-20 14:44:48,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:44:48,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008039703] [2024-11-20 14:44:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008039703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:44:48,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:44:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-11-20 14:44:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839550548] [2024-11-20 14:44:48,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:44:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:44:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:44:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-11-20 14:44:48,732 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-20 14:44:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:48,988 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2024-11-20 14:44:48,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:44:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 26 [2024-11-20 14:44:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:48,990 INFO L225 Difference]: With dead ends: 137 [2024-11-20 14:44:48,991 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 14:44:48,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-20 14:44:48,992 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 62 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:48,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 267 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2024-11-20 14:44:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 14:44:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2024-11-20 14:44:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 103 states have internal predecessors, (129), 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-20 14:44:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2024-11-20 14:44:48,998 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 26 [2024-11-20 14:44:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:48,998 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-11-20 14:44:48,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-20 14:44:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2024-11-20 14:44:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:44:49,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:49,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:49,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 14:44:49,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:44:49,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:49,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -878858932, now seen corresponding path program 1 times [2024-11-20 14:44:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:49,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344014355] [2024-11-20 14:44:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:49,203 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-20 14:44:49,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:49,205 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-20 14:44:49,206 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-20 14:44:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:49,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 14:44:49,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:49,334 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-20 14:44:49,736 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-20 14:44:49,770 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:44:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 16 [2024-11-20 14:44:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:44:49,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:50,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344014355] [2024-11-20 14:44:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344014355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:44:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [261325515] [2024-11-20 14:44:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:44:50,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:44:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:44:50,083 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-20 14:44:50,084 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-20 14:44:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:44:50,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 14:44:50,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:50,236 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-20 14:44:50,242 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-20 14:44:50,823 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-20 14:44:50,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:44:50,854 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 11 [2024-11-20 14:44:50,864 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:44:50,864 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-20 14:44:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:44:50,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [261325515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:44:55,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:44:55,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2024-11-20 14:44:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324230770] [2024-11-20 14:44:55,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:44:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 14:44:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 14:44:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=563, Unknown=3, NotChecked=98, Total=756 [2024-11-20 14:44:55,130 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:44:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:44:56,613 INFO L93 Difference]: Finished difference Result 287 states and 373 transitions. [2024-11-20 14:44:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 14:44:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-20 14:44:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:44:56,616 INFO L225 Difference]: With dead ends: 287 [2024-11-20 14:44:56,616 INFO L226 Difference]: Without dead ends: 287 [2024-11-20 14:44:56,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=157, Invalid=904, Unknown=3, NotChecked=126, Total=1190 [2024-11-20 14:44:56,617 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 321 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:44:56,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 693 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 762 Invalid, 0 Unknown, 454 Unchecked, 1.1s Time] [2024-11-20 14:44:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-20 14:44:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 114. [2024-11-20 14:44:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 108 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:44:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2024-11-20 14:44:56,623 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 26 [2024-11-20 14:44:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:44:56,626 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2024-11-20 14:44:56,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:44:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2024-11-20 14:44:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:44:56,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:44:56,627 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:44:56,632 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-20 14:44:56,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-20 14:44:57,028 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-20 14:44:57,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:44:57,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:44:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash 245332006, now seen corresponding path program 2 times [2024-11-20 14:44:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:44:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153951219] [2024-11-20 14:44:57,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:44:57,029 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-20 14:44:57,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:44:57,030 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-20 14:44:57,031 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-20 14:44:57,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:44:57,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:44:57,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:44:57,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:44:57,152 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-20 14:44:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:57,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:44:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:44:59,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:44:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153951219] [2024-11-20 14:44:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153951219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:44:59,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:44:59,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2024-11-20 14:44:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159621031] [2024-11-20 14:44:59,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:44:59,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-20 14:44:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:44:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-20 14:44:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-11-20 14:44:59,212 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand has 28 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 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-20 14:45:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:03,328 INFO L93 Difference]: Finished difference Result 137 states and 179 transitions. [2024-11-20 14:45:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 14:45:03,329 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 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 26 [2024-11-20 14:45:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:03,330 INFO L225 Difference]: With dead ends: 137 [2024-11-20 14:45:03,330 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 14:45:03,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=411, Invalid=1311, Unknown=0, NotChecked=0, Total=1722 [2024-11-20 14:45:03,331 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 183 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:03,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 540 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 14:45:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 14:45:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2024-11-20 14:45:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 126 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:45:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2024-11-20 14:45:03,337 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 26 [2024-11-20 14:45:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:03,338 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2024-11-20 14:45:03,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 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-20 14:45:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2024-11-20 14:45:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:45:03,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:03,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:03,343 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-20 14:45:03,539 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-20 14:45:03,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:03,540 INFO L85 PathProgramCache]: Analyzing trace with hash -24310932, now seen corresponding path program 1 times [2024-11-20 14:45:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:03,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893454187] [2024-11-20 14:45:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:03,541 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-20 14:45:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:03,542 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-20 14:45:03,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 14:45:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:03,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:45:03,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:03,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:03,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893454187] [2024-11-20 14:45:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893454187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:03,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:03,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-20 14:45:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959674229] [2024-11-20 14:45:03,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:03,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:45:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:45:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:45:03,765 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-20 14:45:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:04,019 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2024-11-20 14:45:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:45:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 27 [2024-11-20 14:45:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:04,021 INFO L225 Difference]: With dead ends: 169 [2024-11-20 14:45:04,021 INFO L226 Difference]: Without dead ends: 169 [2024-11-20 14:45:04,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:45:04,022 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 180 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:04,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 404 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:45:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-20 14:45:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2024-11-20 14:45:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 122 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:45:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2024-11-20 14:45:04,026 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 27 [2024-11-20 14:45:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:04,026 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2024-11-20 14:45:04,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-20 14:45:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2024-11-20 14:45:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:45:04,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:04,027 INFO L215 NwaCegarLoop]: trace histogram [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-20 14:45:04,035 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-20 14:45:04,228 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-20 14:45:04,228 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:04,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1525074233, now seen corresponding path program 1 times [2024-11-20 14:45:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121507117] [2024-11-20 14:45:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:04,229 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-20 14:45:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:04,230 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-20 14:45:04,232 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-20 14:45:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:04,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:45:04,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:04,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:45:04,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:04,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121507117] [2024-11-20 14:45:04,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121507117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:45:04,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:45:04,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:45:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203778525] [2024-11-20 14:45:04,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:45:04,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:45:04,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:45:04,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:45:04,309 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-20 14:45:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:04,333 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2024-11-20 14:45:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:45:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 28 [2024-11-20 14:45:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:04,335 INFO L225 Difference]: With dead ends: 137 [2024-11-20 14:45:04,335 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 14:45:04,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-20 14:45:04,335 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:04,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:45:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 14:45:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2024-11-20 14:45:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 124 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:45:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2024-11-20 14:45:04,340 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 28 [2024-11-20 14:45:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:04,340 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2024-11-20 14:45:04,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-20 14:45:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2024-11-20 14:45:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:45:04,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:04,341 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, 1, 1, 1, 1] [2024-11-20 14:45:04,345 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 (20)] Ended with exit code 0 [2024-11-20 14:45:04,541 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-20 14:45:04,542 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:04,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1027082728, now seen corresponding path program 1 times [2024-11-20 14:45:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667095315] [2024-11-20 14:45:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:04,543 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-20 14:45:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:04,545 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-20 14:45:04,546 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-20 14:45:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:04,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:45:04,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:45:04,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:45:04,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667095315] [2024-11-20 14:45:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667095315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:45:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:45:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:45:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504409700] [2024-11-20 14:45:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:45:04,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:45:04,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:04,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:45:04,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:45:04,628 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-20 14:45:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:04,685 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2024-11-20 14:45:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:45:04,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 28 [2024-11-20 14:45:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:04,686 INFO L225 Difference]: With dead ends: 126 [2024-11-20 14:45:04,686 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 14:45:04,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-20 14:45:04,687 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:04,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:45:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 14:45:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-20 14:45:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 114 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:45:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-20 14:45:04,690 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 28 [2024-11-20 14:45:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:04,691 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-20 14:45:04,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-20 14:45:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-20 14:45:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:45:04,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:04,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:04,695 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-20 14:45:04,892 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-20 14:45:04,892 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1822208300, now seen corresponding path program 2 times [2024-11-20 14:45:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157216886] [2024-11-20 14:45:04,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:45:04,893 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-20 14:45:04,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:04,896 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-20 14:45:04,899 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-20 14:45:04,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:45:04,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:04,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 14:45:04,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:05,032 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-20 14:45:05,039 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-20 14:45:05,575 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-20 14:45:05,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:05,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2024-11-20 14:45:05,611 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:05,611 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-20 14:45:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:45:05,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:09,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157216886] [2024-11-20 14:45:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157216886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750561287] [2024-11-20 14:45:09,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:45:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:45:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:45:09,898 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:45:09,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-20 14:45:10,044 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:45:10,044 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:10,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 14:45:10,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:10,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:45:10,072 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-20 14:45:10,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:10,348 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 21 treesize of output 14 [2024-11-20 14:45:10,368 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:10,369 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-20 14:45:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:45:10,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:14,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul |c_ULTIMATE.start_alloc_17_~i~0#1| (_ bv4 32)))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_alloc_17_~array#1.offset|))) (and (or (forall ((|v_ldv_malloc_#res.base_47| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_47|)))) (bvule (bvadd .cse0 |c_ULTIMATE.start_alloc_17_~array#1.offset|) .cse1)) (forall ((|v_ldv_malloc_#res.base_47| (_ BitVec 32))) (or (forall ((v_ArrVal_217 (_ BitVec 32))) (bvule .cse1 (select (store |c_#length| |v_ldv_malloc_#res.base_47| v_ArrVal_217) |c_ULTIMATE.start_alloc_17_~array#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_47|)))))))) is different from false [2024-11-20 14:45:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1750561287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:14,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:14,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2024-11-20 14:45:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515274926] [2024-11-20 14:45:14,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:45:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:45:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=286, Unknown=3, NotChecked=70, Total=420 [2024-11-20 14:45:14,514 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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-20 14:45:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:15,766 INFO L93 Difference]: Finished difference Result 195 states and 239 transitions. [2024-11-20 14:45:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:45:15,767 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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 29 [2024-11-20 14:45:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:15,767 INFO L225 Difference]: With dead ends: 195 [2024-11-20 14:45:15,768 INFO L226 Difference]: Without dead ends: 195 [2024-11-20 14:45:15,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=102, Invalid=503, Unknown=3, NotChecked=94, Total=702 [2024-11-20 14:45:15,768 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 120 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:15,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 845 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 783 Invalid, 0 Unknown, 156 Unchecked, 1.0s Time] [2024-11-20 14:45:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-20 14:45:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2024-11-20 14:45:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 114 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:45:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2024-11-20 14:45:15,773 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 29 [2024-11-20 14:45:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:15,773 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2024-11-20 14:45:15,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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-20 14:45:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2024-11-20 14:45:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:45:15,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:15,774 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:15,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-20 14:45:15,980 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 (22)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:16,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-20 14:45:16,178 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:16,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:16,178 INFO L85 PathProgramCache]: Analyzing trace with hash -475836742, now seen corresponding path program 1 times [2024-11-20 14:45:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020027850] [2024-11-20 14:45:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:16,179 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-20 14:45:16,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:16,181 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-20 14:45:16,181 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-20 14:45:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:16,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:45:16,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:16,242 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-20 14:45:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:45:16,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:45:16,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020027850] [2024-11-20 14:45:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020027850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:16,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-11-20 14:45:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754266793] [2024-11-20 14:45:16,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:16,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:45:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:45:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:45:16,379 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-20 14:45:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:16,561 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-20 14:45:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:45:16,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 31 [2024-11-20 14:45:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:16,562 INFO L225 Difference]: With dead ends: 138 [2024-11-20 14:45:16,562 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 14:45:16,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:45:16,562 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 39 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:16,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 267 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:45:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 14:45:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2024-11-20 14:45:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 115 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 14:45:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2024-11-20 14:45:16,569 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 31 [2024-11-20 14:45:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2024-11-20 14:45:16,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-20 14:45:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2024-11-20 14:45:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:45:16,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:16,570 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:16,576 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 (24)] Ended with exit code 0 [2024-11-20 14:45:16,771 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 [2024-11-20 14:45:16,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -475836741, now seen corresponding path program 1 times [2024-11-20 14:45:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994012645] [2024-11-20 14:45:16,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:16,772 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-20 14:45:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:16,773 INFO L229 MonitoredProcess]: Starting monitored process 25 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-20 14:45:16,774 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 (25)] Waiting until timeout for monitored process [2024-11-20 14:45:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:16,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 14:45:16,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:16,894 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-20 14:45:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:17,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:17,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994012645] [2024-11-20 14:45:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994012645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:17,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-11-20 14:45:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912579435] [2024-11-20 14:45:17,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 14:45:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 14:45:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:45:17,958 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 19 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-20 14:45:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:19,260 INFO L93 Difference]: Finished difference Result 223 states and 268 transitions. [2024-11-20 14:45:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:45:19,262 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 31 [2024-11-20 14:45:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:19,263 INFO L225 Difference]: With dead ends: 223 [2024-11-20 14:45:19,263 INFO L226 Difference]: Without dead ends: 223 [2024-11-20 14:45:19,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-11-20 14:45:19,264 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 242 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:19,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 595 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 14:45:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-20 14:45:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 148. [2024-11-20 14:45:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 139 states have internal predecessors, (176), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-20 14:45:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2024-11-20 14:45:19,271 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 31 [2024-11-20 14:45:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:19,272 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2024-11-20 14:45:19,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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-20 14:45:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2024-11-20 14:45:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:45:19,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:19,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:19,277 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 (25)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:19,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:19,477 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 818465469, now seen corresponding path program 1 times [2024-11-20 14:45:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160977136] [2024-11-20 14:45:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:19,478 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-20 14:45:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:19,479 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-20 14:45:19,480 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-20 14:45:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:19,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:45:19,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:19,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:19,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:45:19,757 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 25 treesize of output 29 [2024-11-20 14:45:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:19,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:19,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160977136] [2024-11-20 14:45:19,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160977136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:19,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:19,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-20 14:45:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618373100] [2024-11-20 14:45:19,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:19,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:45:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:45:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:45:19,947 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:45:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:20,440 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2024-11-20 14:45:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:45:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-20 14:45:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:20,442 INFO L225 Difference]: With dead ends: 204 [2024-11-20 14:45:20,442 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 14:45:20,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:45:20,443 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:20,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 358 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:45:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 14:45:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2024-11-20 14:45:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 153 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-20 14:45:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2024-11-20 14:45:20,448 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 32 [2024-11-20 14:45:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:20,448 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2024-11-20 14:45:20,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:45:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2024-11-20 14:45:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:45:20,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:20,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:20,453 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-20 14:45:20,650 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-20 14:45:20,650 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1191141044, now seen corresponding path program 3 times [2024-11-20 14:45:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086468814] [2024-11-20 14:45:20,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:45:20,651 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-20 14:45:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:20,652 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-20 14:45:20,654 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-20 14:45:20,717 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-20 14:45:20,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:20,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:45:20,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:20,759 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-20 14:45:20,766 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-20 14:45:21,079 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-20 14:45:21,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:21,105 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 11 [2024-11-20 14:45:21,112 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:21,112 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-20 14:45:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2024-11-20 14:45:21,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:21,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086468814] [2024-11-20 14:45:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086468814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1184572420] [2024-11-20 14:45:21,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:45:21,460 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:45:21,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:45:21,461 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:45:21,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-20 14:45:21,575 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-20 14:45:21,575 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:21,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:45:21,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:21,590 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-20 14:45:21,595 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-20 14:45:21,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:21,813 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 11 [2024-11-20 14:45:21,826 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:21,827 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-20 14:45:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2024-11-20 14:45:21,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1184572420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:26,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:26,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-11-20 14:45:26,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848887160] [2024-11-20 14:45:26,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:26,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:45:26,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:26,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:45:26,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=153, Unknown=1, NotChecked=24, Total=210 [2024-11-20 14:45:26,015 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 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-20 14:45:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:27,440 INFO L93 Difference]: Finished difference Result 186 states and 237 transitions. [2024-11-20 14:45:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:45:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 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 32 [2024-11-20 14:45:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:27,443 INFO L225 Difference]: With dead ends: 186 [2024-11-20 14:45:27,443 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 14:45:27,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2024-11-20 14:45:27,444 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 129 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:27,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 495 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 382 Invalid, 0 Unknown, 117 Unchecked, 1.0s Time] [2024-11-20 14:45:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 14:45:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-20 14:45:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.406015037593985) internal successors, (187), 146 states have internal predecessors, (187), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-20 14:45:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 204 transitions. [2024-11-20 14:45:27,452 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 204 transitions. Word has length 32 [2024-11-20 14:45:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:27,453 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 204 transitions. [2024-11-20 14:45:27,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 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-20 14:45:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 204 transitions. [2024-11-20 14:45:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 14:45:27,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:27,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:27,460 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 (27)] Ended with exit code 0 [2024-11-20 14:45:27,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:27,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 14:45:27,854 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:27,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -397374190, now seen corresponding path program 1 times [2024-11-20 14:45:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649421310] [2024-11-20 14:45:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:27,855 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-20 14:45:27,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:27,856 INFO L229 MonitoredProcess]: Starting monitored process 29 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-20 14:45:27,857 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 (29)] Waiting until timeout for monitored process [2024-11-20 14:45:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:27,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:45:27,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:28,039 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-20 14:45:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:28,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:28,141 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 36 treesize of output 32 [2024-11-20 14:45:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:28,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649421310] [2024-11-20 14:45:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649421310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:28,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-20 14:45:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953221686] [2024-11-20 14:45:28,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:45:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:45:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:45:28,331 INFO L87 Difference]: Start difference. First operand 156 states and 204 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 1 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-20 14:45:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:28,931 INFO L93 Difference]: Finished difference Result 222 states and 290 transitions. [2024-11-20 14:45:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:45:28,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 1 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 33 [2024-11-20 14:45:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:28,933 INFO L225 Difference]: With dead ends: 222 [2024-11-20 14:45:28,934 INFO L226 Difference]: Without dead ends: 222 [2024-11-20 14:45:28,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:45:28,934 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 51 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:28,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 527 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 14:45:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-20 14:45:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2024-11-20 14:45:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 171 states have (on average 1.4619883040935673) internal successors, (250), 183 states have internal predecessors, (250), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-20 14:45:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2024-11-20 14:45:28,942 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 33 [2024-11-20 14:45:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:28,943 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2024-11-20 14:45:28,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 1 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-20 14:45:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2024-11-20 14:45:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:45:28,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:28,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:28,948 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 (29)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:29,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:29,144 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:29,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash 566302140, now seen corresponding path program 1 times [2024-11-20 14:45:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:29,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021674630] [2024-11-20 14:45:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:29,146 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-20 14:45:29,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:29,147 INFO L229 MonitoredProcess]: Starting monitored process 30 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-20 14:45:29,148 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 (30)] Waiting until timeout for monitored process [2024-11-20 14:45:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:29,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:45:29,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:29,594 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-20 14:45:29,742 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-20 14:45:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:45:29,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:29,904 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 36 treesize of output 32 [2024-11-20 14:45:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:30,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:30,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021674630] [2024-11-20 14:45:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021674630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:30,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:30,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2024-11-20 14:45:30,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271921725] [2024-11-20 14:45:30,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:30,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:45:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:30,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:45:30,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:45:30,172 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 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-20 14:45:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:31,870 INFO L93 Difference]: Finished difference Result 225 states and 293 transitions. [2024-11-20 14:45:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:45:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 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 34 [2024-11-20 14:45:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:31,872 INFO L225 Difference]: With dead ends: 225 [2024-11-20 14:45:31,872 INFO L226 Difference]: Without dead ends: 223 [2024-11-20 14:45:31,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-20 14:45:31,873 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 106 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:31,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 527 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 14:45:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-20 14:45:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2024-11-20 14:45:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.4540229885057472) internal successors, (253), 185 states have internal predecessors, (253), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-20 14:45:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 270 transitions. [2024-11-20 14:45:31,878 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 270 transitions. Word has length 34 [2024-11-20 14:45:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:31,878 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 270 transitions. [2024-11-20 14:45:31,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 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-20 14:45:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 270 transitions. [2024-11-20 14:45:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 14:45:31,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:31,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:31,884 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 (30)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:32,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:32,080 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:32,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash 375497300, now seen corresponding path program 1 times [2024-11-20 14:45:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547576659] [2024-11-20 14:45:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:32,081 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-20 14:45:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:32,082 INFO L229 MonitoredProcess]: Starting monitored process 31 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-20 14:45:32,083 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 (31)] Waiting until timeout for monitored process [2024-11-20 14:45:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:32,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:45:32,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:32,188 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-20 14:45:32,268 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-20 14:45:32,305 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-20 14:45:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:32,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:32,361 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 44 treesize of output 40 [2024-11-20 14:45:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:32,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547576659] [2024-11-20 14:45:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547576659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:32,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-20 14:45:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495818386] [2024-11-20 14:45:32,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:32,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:45:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:45:32,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:45:32,605 INFO L87 Difference]: Start difference. First operand 197 states and 270 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (3), 1 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-20 14:45:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:33,208 INFO L93 Difference]: Finished difference Result 206 states and 280 transitions. [2024-11-20 14:45:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:45:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (3), 1 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 35 [2024-11-20 14:45:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:33,211 INFO L225 Difference]: With dead ends: 206 [2024-11-20 14:45:33,211 INFO L226 Difference]: Without dead ends: 206 [2024-11-20 14:45:33,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:45:33,212 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:33,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 430 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 14:45:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-20 14:45:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2024-11-20 14:45:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 175 states have (on average 1.4514285714285715) internal successors, (254), 186 states have internal predecessors, (254), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-20 14:45:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 271 transitions. [2024-11-20 14:45:33,217 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 271 transitions. Word has length 35 [2024-11-20 14:45:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:33,218 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 271 transitions. [2024-11-20 14:45:33,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (3), 1 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-20 14:45:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 271 transitions. [2024-11-20 14:45:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 14:45:33,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:33,218 INFO L215 NwaCegarLoop]: trace histogram [3, 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-20 14:45:33,225 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 (31)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:33,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:33,421 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:33,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2027972411, now seen corresponding path program 1 times [2024-11-20 14:45:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119606967] [2024-11-20 14:45:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:33,422 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-20 14:45:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:33,425 INFO L229 MonitoredProcess]: Starting monitored process 32 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-20 14:45:33,426 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 (32)] Waiting until timeout for monitored process [2024-11-20 14:45:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:33,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 14:45:33,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 14:45:33,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-20 14:45:33,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119606967] [2024-11-20 14:45:33,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119606967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:33,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:33,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-20 14:45:33,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154018078] [2024-11-20 14:45:33,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:33,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:45:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:33,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:45:33,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:45:33,995 INFO L87 Difference]: Start difference. First operand 198 states and 271 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-20 14:45:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:34,226 INFO L93 Difference]: Finished difference Result 218 states and 294 transitions. [2024-11-20 14:45:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:45:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2024-11-20 14:45:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:34,230 INFO L225 Difference]: With dead ends: 218 [2024-11-20 14:45:34,230 INFO L226 Difference]: Without dead ends: 218 [2024-11-20 14:45:34,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:45:34,231 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 144 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:34,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 419 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:45:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-20 14:45:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2024-11-20 14:45:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 187 states have (on average 1.427807486631016) internal successors, (267), 197 states have internal predecessors, (267), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-20 14:45:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 287 transitions. [2024-11-20 14:45:34,238 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 287 transitions. Word has length 36 [2024-11-20 14:45:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:34,238 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 287 transitions. [2024-11-20 14:45:34,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-20 14:45:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 287 transitions. [2024-11-20 14:45:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 14:45:34,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:34,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:34,244 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 (32)] Ended with exit code 0 [2024-11-20 14:45:34,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:34,440 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:34,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1883049109, now seen corresponding path program 1 times [2024-11-20 14:45:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961484054] [2024-11-20 14:45:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:34,441 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-20 14:45:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:34,442 INFO L229 MonitoredProcess]: Starting monitored process 33 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-20 14:45:34,443 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 (33)] Waiting until timeout for monitored process [2024-11-20 14:45:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:34,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:45:34,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:45:34,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:45:34,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961484054] [2024-11-20 14:45:34,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961484054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:45:34,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:45:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:45:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704695509] [2024-11-20 14:45:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:45:34,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:45:34,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:45:34,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:45:34,577 INFO L87 Difference]: Start difference. First operand 211 states and 287 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-20 14:45:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:34,601 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2024-11-20 14:45:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:45:34,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 35 [2024-11-20 14:45:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:34,604 INFO L225 Difference]: With dead ends: 164 [2024-11-20 14:45:34,604 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 14:45:34,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-20 14:45:34,605 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:34,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:45:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 14:45:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-11-20 14:45:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 151 states have internal predecessors, (190), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-20 14:45:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2024-11-20 14:45:34,614 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 35 [2024-11-20 14:45:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:34,615 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2024-11-20 14:45:34,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-20 14:45:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2024-11-20 14:45:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 14:45:34,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:34,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:34,620 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 (33)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:34,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:34,820 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash -185148971, now seen corresponding path program 1 times [2024-11-20 14:45:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259916084] [2024-11-20 14:45:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:34,821 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-20 14:45:34,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:34,822 INFO L229 MonitoredProcess]: Starting monitored process 34 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-20 14:45:34,823 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 (34)] Waiting until timeout for monitored process [2024-11-20 14:45:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:34,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:45:34,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:35,040 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-20 14:45:35,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:35,148 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-20 14:45:35,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:35,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259916084] [2024-11-20 14:45:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259916084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:35,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:35,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-20 14:45:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120963650] [2024-11-20 14:45:35,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:35,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:45:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:45:35,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:45:35,150 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-20 14:45:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:35,279 INFO L93 Difference]: Finished difference Result 172 states and 209 transitions. [2024-11-20 14:45:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:45:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 36 [2024-11-20 14:45:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:35,281 INFO L225 Difference]: With dead ends: 172 [2024-11-20 14:45:35,282 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 14:45:35,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:45:35,283 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:35,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 332 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:45:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 14:45:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2024-11-20 14:45:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 148 states have internal predecessors, (182), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-20 14:45:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2024-11-20 14:45:35,287 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 36 [2024-11-20 14:45:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:35,287 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2024-11-20 14:45:35,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-20 14:45:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2024-11-20 14:45:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 14:45:35,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:35,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:35,291 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 (34)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:35,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:35,489 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:35,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2145816479, now seen corresponding path program 1 times [2024-11-20 14:45:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406895733] [2024-11-20 14:45:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:35,489 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-20 14:45:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:35,491 INFO L229 MonitoredProcess]: Starting monitored process 35 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-20 14:45:35,491 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 (35)] Waiting until timeout for monitored process [2024-11-20 14:45:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:35,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 14:45:35,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 14:45:35,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 14:45:35,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:35,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406895733] [2024-11-20 14:45:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406895733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:35,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-20 14:45:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779079592] [2024-11-20 14:45:35,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:35,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:45:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:45:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:45:35,939 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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-20 14:45:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:36,172 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2024-11-20 14:45:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:45:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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 37 [2024-11-20 14:45:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:36,174 INFO L225 Difference]: With dead ends: 173 [2024-11-20 14:45:36,174 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 14:45:36,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:45:36,178 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 96 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:36,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 405 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:45:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 14:45:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-20 14:45:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.2980132450331126) internal successors, (196), 161 states have internal predecessors, (196), 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-20 14:45:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2024-11-20 14:45:36,183 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 37 [2024-11-20 14:45:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:36,184 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2024-11-20 14:45:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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-20 14:45:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2024-11-20 14:45:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-20 14:45:36,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:36,184 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:36,188 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 (35)] Ended with exit code 0 [2024-11-20 14:45:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:36,385 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 731071653, now seen corresponding path program 2 times [2024-11-20 14:45:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99996120] [2024-11-20 14:45:36,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:45:36,386 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-20 14:45:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:36,387 INFO L229 MonitoredProcess]: Starting monitored process 36 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-20 14:45:36,389 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 (36)] Waiting until timeout for monitored process [2024-11-20 14:45:36,500 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:45:36,500 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:36,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 14:45:36,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:36,552 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-20 14:45:36,557 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-20 14:45:37,126 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-20 14:45:37,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:37,152 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 21 treesize of output 14 [2024-11-20 14:45:37,169 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:37,169 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-20 14:45:37,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:37,520 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 21 treesize of output 14 [2024-11-20 14:45:37,552 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:37,553 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-20 14:45:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-20 14:45:37,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:45,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99996120] [2024-11-20 14:45:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99996120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2100215567] [2024-11-20 14:45:45,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:45:45,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:45:45,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:45:45,968 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:45:45,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-20 14:45:46,132 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:45:46,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:46,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 14:45:46,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:46,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 14:45:46,154 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-20 14:45:46,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:46,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 21 treesize of output 14 [2024-11-20 14:45:46,431 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:46,431 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-20 14:45:46,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:45:46,601 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 21 treesize of output 14 [2024-11-20 14:45:46,612 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 14:45:46,613 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-20 14:45:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-20 14:45:46,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2100215567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:46,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:46,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2024-11-20 14:45:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492186110] [2024-11-20 14:45:46,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:46,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 14:45:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:46,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 14:45:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=354, Unknown=3, NotChecked=38, Total=462 [2024-11-20 14:45:46,859 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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-20 14:45:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:48,282 INFO L93 Difference]: Finished difference Result 202 states and 244 transitions. [2024-11-20 14:45:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 14:45:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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 39 [2024-11-20 14:45:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:48,284 INFO L225 Difference]: With dead ends: 202 [2024-11-20 14:45:48,284 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 14:45:48,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=123, Invalid=690, Unknown=3, NotChecked=54, Total=870 [2024-11-20 14:45:48,285 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:48,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 598 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 635 Invalid, 0 Unknown, 120 Unchecked, 1.0s Time] [2024-11-20 14:45:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 14:45:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2024-11-20 14:45:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 161 states have (on average 1.2857142857142858) internal successors, (207), 171 states have internal predecessors, (207), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-20 14:45:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 227 transitions. [2024-11-20 14:45:48,292 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 227 transitions. Word has length 39 [2024-11-20 14:45:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:48,293 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 227 transitions. [2024-11-20 14:45:48,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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-20 14:45:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 227 transitions. [2024-11-20 14:45:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 14:45:48,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:48,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:48,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-20 14:45:48,498 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 (36)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:48,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:48,695 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:48,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash -275846323, now seen corresponding path program 1 times [2024-11-20 14:45:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:48,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850418379] [2024-11-20 14:45:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:48,696 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-20 14:45:48,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:48,697 INFO L229 MonitoredProcess]: Starting monitored process 38 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-20 14:45:48,698 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 (38)] Waiting until timeout for monitored process [2024-11-20 14:45:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:48,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:45:48,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:48,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 14:45:48,851 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 11 treesize of output 7 [2024-11-20 14:45:48,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-20 14:45:49,046 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 7 treesize of output 3 [2024-11-20 14:45:49,079 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-20 14:45:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:49,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:49,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850418379] [2024-11-20 14:45:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850418379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1437090859] [2024-11-20 14:45:49,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:49,253 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:45:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:45:49,254 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:45:49,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-20 14:45:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:49,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 14:45:49,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:49,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 14:45:49,537 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 11 treesize of output 7 [2024-11-20 14:45:49,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-11-20 14:45:49,966 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 7 treesize of output 3 [2024-11-20 14:45:49,994 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-20 14:45:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:50,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1437090859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:45:50,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2024-11-20 14:45:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714471002] [2024-11-20 14:45:50,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:45:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:45:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-20 14:45:50,114 INFO L87 Difference]: Start difference. First operand 185 states and 227 transitions. Second operand has 17 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:45:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:50,631 INFO L93 Difference]: Finished difference Result 218 states and 261 transitions. [2024-11-20 14:45:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:45:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-11-20 14:45:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:50,632 INFO L225 Difference]: With dead ends: 218 [2024-11-20 14:45:50,633 INFO L226 Difference]: Without dead ends: 218 [2024-11-20 14:45:50,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-11-20 14:45:50,633 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 23 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:50,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 479 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:45:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-20 14:45:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2024-11-20 14:45:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 194 states have internal predecessors, (232), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-20 14:45:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2024-11-20 14:45:50,637 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 40 [2024-11-20 14:45:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:50,637 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2024-11-20 14:45:50,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5625) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:45:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2024-11-20 14:45:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-20 14:45:50,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:50,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:50,642 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 (38)] Ended with exit code 0 [2024-11-20 14:45:50,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:51,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 14:45:51,039 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:51,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash -72017103, now seen corresponding path program 1 times [2024-11-20 14:45:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392244370] [2024-11-20 14:45:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:45:51,040 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-20 14:45:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:51,041 INFO L229 MonitoredProcess]: Starting monitored process 40 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-20 14:45:51,042 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 (40)] Waiting until timeout for monitored process [2024-11-20 14:45:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:45:51,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:45:51,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:45:51,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:45:51,832 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-20 14:45:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:45:52,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:45:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392244370] [2024-11-20 14:45:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392244370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:45:52,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:45:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-20 14:45:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176174936] [2024-11-20 14:45:52,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:45:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:45:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:45:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:45:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:45:52,178 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 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-20 14:45:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:45:53,241 INFO L93 Difference]: Finished difference Result 214 states and 255 transitions. [2024-11-20 14:45:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:45:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 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 41 [2024-11-20 14:45:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:45:53,243 INFO L225 Difference]: With dead ends: 214 [2024-11-20 14:45:53,243 INFO L226 Difference]: Without dead ends: 214 [2024-11-20 14:45:53,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-11-20 14:45:53,243 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 156 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:45:53,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 614 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 14:45:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-20 14:45:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 206. [2024-11-20 14:45:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 191 states have internal predecessors, (226), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (13), 11 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-20 14:45:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2024-11-20 14:45:53,248 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 41 [2024-11-20 14:45:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:45:53,248 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2024-11-20 14:45:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 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-20 14:45:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2024-11-20 14:45:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 14:45:53,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:45:53,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:45:53,254 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 (40)] Forceful destruction successful, exit code 0 [2024-11-20 14:45:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-20 14:45:53,450 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-20 14:45:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:45:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1776836543, now seen corresponding path program 2 times [2024-11-20 14:45:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:45:53,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193889547] [2024-11-20 14:45:53,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:45:53,451 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-20 14:45:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:45:53,452 INFO L229 MonitoredProcess]: Starting monitored process 41 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-20 14:45:53,454 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 (41)] Waiting until timeout for monitored process [2024-11-20 14:45:53,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:45:53,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:45:53,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:45:53,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:45:53,597 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 11 treesize of output 7 [2024-11-20 14:45:53,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-20 14:45:53,904 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 7 treesize of output 3 [2024-11-20 14:45:53,958 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-20 14:45:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:45:53,997 INFO L311 TraceCheckSpWp]: Computing backward predicates...