./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:35:35,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:35:35,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:35:35,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:35:35,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:35:35,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:35:35,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:35:35,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:35:35,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:35:35,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:35:35,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:35:35,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:35:35,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:35:35,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:35:35,645 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:35:35,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:35:35,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:35:35,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:35:35,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:35:35,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:35:35,646 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:35:35,648 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:35:35,648 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:35:35,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:35:35,648 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:35:35,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:35:35,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:35:35,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:35:35,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:35:35,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:35:35,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:35:35,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:35:35,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:35:35,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:35:35,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:35:35,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:35:35,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:35:35,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:35:35,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:35:35,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:35:35,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:35:35,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:35:35,658 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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2024-11-10 17:35:35,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:35:35,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:35:35,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:35:35,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:35:35,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:35:35,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2024-11-10 17:35:37,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:35:37,465 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:35:37,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2024-11-10 17:35:37,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80ac0c0b/8c21efdc0d1e4890a21f39f3cae2edf4/FLAG539361601 [2024-11-10 17:35:37,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80ac0c0b/8c21efdc0d1e4890a21f39f3cae2edf4 [2024-11-10 17:35:37,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:35:37,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:35:37,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:37,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:35:37,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:35:37,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:37" (1/1) ... [2024-11-10 17:35:37,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26607c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:37, skipping insertion in model container [2024-11-10 17:35:37,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:37" (1/1) ... [2024-11-10 17:35:37,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:35:37,956 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:37,988 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:37,993 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:37,996 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,000 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,029 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,030 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,032 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,037 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,062 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,062 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,064 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,064 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,073 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,075 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,076 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,077 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,077 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,080 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,081 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,081 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,082 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,084 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:38,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:38,106 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-10 17:35:38,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@75c0eacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:38, skipping insertion in model container [2024-11-10 17:35:38,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:38,108 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:35:38,109 INFO L158 Benchmark]: Toolchain (without parser) took 602.32ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 74.3MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 17:35:38,110 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:35:38,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.83ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 74.3MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 17:35:38,112 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.14ms. Allocated memory is still 161.5MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.83ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 74.3MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:35:39,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:35:39,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:35:39,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:35:39,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:35:39,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:35:39,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:35:39,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:35:39,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:35:39,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:35:39,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:35:39,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:35:39,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:35:39,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:35:39,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:35:39,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:35:39,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:35:39,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:35:39,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:35:39,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:35:39,896 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:35:39,898 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:35:39,898 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:35:39,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:35:39,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:35:39,898 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:35:39,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:35:39,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:35:39,899 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:35:39,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:35:39,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:35:39,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:35:39,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:35:39,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:35:39,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:35:39,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:35:39,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:35:39,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:35:39,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:35:39,901 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:35:39,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:35:39,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:35:39,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:35:39,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:35:39,903 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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2024-11-10 17:35:40,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:35:40,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:35:40,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:35:40,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:35:40,195 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:35:40,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2024-11-10 17:35:41,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:35:41,752 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:35:41,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2024-11-10 17:35:41,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5f9a791/c086aabf7caa40589382624c1e7b0f5b/FLAGe24cec2dc [2024-11-10 17:35:41,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5f9a791/c086aabf7caa40589382624c1e7b0f5b [2024-11-10 17:35:41,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:35:41,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:35:41,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:41,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:35:41,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:35:41,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:41" (1/1) ... [2024-11-10 17:35:41,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359f3d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:41, skipping insertion in model container [2024-11-10 17:35:41,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:35:41" (1/1) ... [2024-11-10 17:35:41,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:35:42,239 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,273 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,290 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,298 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,306 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,344 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,346 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,351 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,358 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,377 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,381 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,383 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,384 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,385 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,386 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,387 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,388 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,389 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,391 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,392 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,392 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,393 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:42,423 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:35:42,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:35:42,457 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,469 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,478 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,482 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,491 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,492 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,495 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,497 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,524 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,525 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,526 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,526 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,527 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,529 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,531 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,531 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,533 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,536 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,537 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,537 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,538 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,539 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:35:42,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:42,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:35:42,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:35:42,644 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:35:42,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42 WrapperNode [2024-11-10 17:35:42,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:35:42,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:35:42,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:35:42,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:35:42,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,766 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1704 [2024-11-10 17:35:42,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:35:42,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:35:42,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:35:42,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:35:42,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,905 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2024-11-10 17:35:42,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:35:42,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:35:42,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:35:42,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:35:42,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (1/1) ... [2024-11-10 17:35:42,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:35:43,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:35:43,019 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-10 17:35:43,022 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-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:35:43,062 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:35:43,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:35:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:35:43,063 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:35:43,063 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:35:43,063 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:35:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:35:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:35:43,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:35:43,286 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:35:43,288 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:35:47,334 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2024-11-10 17:35:47,485 INFO L? ?]: Removed 1906 outVars from TransFormulas that were not future-live. [2024-11-10 17:35:47,486 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:35:47,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:35:47,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:35:47,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:35:47 BoogieIcfgContainer [2024-11-10 17:35:47,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:35:47,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:35:47,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:35:47,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:35:47,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:35:41" (1/3) ... [2024-11-10 17:35:47,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fad76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:35:47, skipping insertion in model container [2024-11-10 17:35:47,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:35:42" (2/3) ... [2024-11-10 17:35:47,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fad76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:35:47, skipping insertion in model container [2024-11-10 17:35:47,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:35:47" (3/3) ... [2024-11-10 17:35:47,535 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-3.i [2024-11-10 17:35:47,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:35:47,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 915 error locations. [2024-11-10 17:35:47,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:35:47,627 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;@1c9cfc5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:35:47,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 915 error locations. [2024-11-10 17:35:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 1865 states, 939 states have (on average 2.1831735889243875) internal successors, (2050), 1855 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:35:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:35:47,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:47,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:35:47,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr912REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:47,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1856517027, now seen corresponding path program 1 times [2024-11-10 17:35:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4692357] [2024-11-10 17:35:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:47,658 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-10 17:35:47,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:47,660 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-10 17:35:47,683 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-10 17:35:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:47,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 17:35:47,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:47,836 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-10 17:35:47,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:47,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4692357] [2024-11-10 17:35:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4692357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:47,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008620472] [2024-11-10 17:35:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:47,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:35:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:35:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:35:47,868 INFO L87 Difference]: Start difference. First operand has 1865 states, 939 states have (on average 2.1831735889243875) internal successors, (2050), 1855 states have internal predecessors, (2050), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:47,976 INFO L93 Difference]: Finished difference Result 1843 states and 1944 transitions. [2024-11-10 17:35:47,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:35:47,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:35:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:48,003 INFO L225 Difference]: With dead ends: 1843 [2024-11-10 17:35:48,004 INFO L226 Difference]: Without dead ends: 1840 [2024-11-10 17:35:48,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-10 17:35:48,008 INFO L432 NwaCegarLoop]: 1944 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, 1944 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-10 17:35:48,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-10 17:35:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-11-10 17:35:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 926 states have (on average 2.070194384449244) internal successors, (1917), 1830 states have internal predecessors, (1917), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 1941 transitions. [2024-11-10 17:35:48,123 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 1941 transitions. Word has length 6 [2024-11-10 17:35:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:48,123 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 1941 transitions. [2024-11-10 17:35:48,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 1941 transitions. [2024-11-10 17:35:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:35:48,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:48,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:35:48,127 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-10 17:35:48,324 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-10 17:35:48,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr912REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1856516996, now seen corresponding path program 1 times [2024-11-10 17:35:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664546600] [2024-11-10 17:35:48,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:48,327 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-10 17:35:48,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:48,328 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-10 17:35:48,329 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-10 17:35:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:48,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:48,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:48,499 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-10 17:35:48,513 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-10 17:35:48,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:48,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664546600] [2024-11-10 17:35:48,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664546600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:48,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:48,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:48,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904308844] [2024-11-10 17:35:48,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:48,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:48,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:48,516 INFO L87 Difference]: Start difference. First operand 1840 states and 1941 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:50,767 INFO L93 Difference]: Finished difference Result 1984 states and 2117 transitions. [2024-11-10 17:35:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:35:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:50,773 INFO L225 Difference]: With dead ends: 1984 [2024-11-10 17:35:50,773 INFO L226 Difference]: Without dead ends: 1984 [2024-11-10 17:35:50,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:50,774 INFO L432 NwaCegarLoop]: 1412 mSDtfsCounter, 1290 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:50,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1802 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:35:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-10 17:35:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1748. [2024-11-10 17:35:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 926 states have (on average 1.970842332613391) internal successors, (1825), 1738 states have internal predecessors, (1825), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 1849 transitions. [2024-11-10 17:35:50,821 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 1849 transitions. Word has length 6 [2024-11-10 17:35:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:50,822 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 1849 transitions. [2024-11-10 17:35:50,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 1849 transitions. [2024-11-10 17:35:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:35:50,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:50,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:35:50,827 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-10 17:35:51,026 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-10 17:35:51,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr913REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1856516995, now seen corresponding path program 1 times [2024-11-10 17:35:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784479981] [2024-11-10 17:35:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:51,027 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-10 17:35:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:51,030 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-10 17:35:51,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 (4)] Waiting until timeout for monitored process [2024-11-10 17:35:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:51,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:51,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:51,158 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-10 17:35:51,174 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-10 17:35:51,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:51,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784479981] [2024-11-10 17:35:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784479981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:35:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85412775] [2024-11-10 17:35:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:51,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:51,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:51,177 INFO L87 Difference]: Start difference. First operand 1748 states and 1849 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:53,994 INFO L93 Difference]: Finished difference Result 2309 states and 2461 transitions. [2024-11-10 17:35:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:35:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:54,000 INFO L225 Difference]: With dead ends: 2309 [2024-11-10 17:35:54,000 INFO L226 Difference]: Without dead ends: 2309 [2024-11-10 17:35:54,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:54,001 INFO L432 NwaCegarLoop]: 1777 mSDtfsCounter, 786 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:54,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2619 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:35:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2024-11-10 17:35:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 1922. [2024-11-10 17:35:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1110 states have (on average 1.9387387387387387) internal successors, (2152), 1912 states have internal predecessors, (2152), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2176 transitions. [2024-11-10 17:35:54,030 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2176 transitions. Word has length 6 [2024-11-10 17:35:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2176 transitions. [2024-11-10 17:35:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2176 transitions. [2024-11-10 17:35:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:35:54,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:54,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:54,034 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-10 17:35:54,231 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-10 17:35:54,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr292REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:54,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1743973832, now seen corresponding path program 1 times [2024-11-10 17:35:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779246909] [2024-11-10 17:35:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:54,234 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-10 17:35:54,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:54,235 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-10 17:35:54,237 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-10 17:35:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:54,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:35:54,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:54,357 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-10 17:35:54,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:54,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779246909] [2024-11-10 17:35:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779246909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776583594] [2024-11-10 17:35:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:54,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:54,359 INFO L87 Difference]: Start difference. First operand 1922 states and 2176 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:54,490 INFO L93 Difference]: Finished difference Result 3432 states and 3921 transitions. [2024-11-10 17:35:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:35:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:54,502 INFO L225 Difference]: With dead ends: 3432 [2024-11-10 17:35:54,502 INFO L226 Difference]: Without dead ends: 3432 [2024-11-10 17:35:54,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:54,504 INFO L432 NwaCegarLoop]: 2110 mSDtfsCounter, 1382 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 3939 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:54,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 3939 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:35:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2024-11-10 17:35:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 1926. [2024-11-10 17:35:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1114 states have (on average 1.9353680430879712) internal successors, (2156), 1916 states have internal predecessors, (2156), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2180 transitions. [2024-11-10 17:35:54,550 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2180 transitions. Word has length 8 [2024-11-10 17:35:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:54,551 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2180 transitions. [2024-11-10 17:35:54,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2180 transitions. [2024-11-10 17:35:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:35:54,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:54,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:54,555 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-10 17:35:54,752 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-10 17:35:54,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr908REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash -473468332, now seen corresponding path program 1 times [2024-11-10 17:35:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360707070] [2024-11-10 17:35:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:54,754 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-10 17:35:54,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:54,759 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-10 17:35:54,760 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-10 17:35:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:54,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:35:54,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:54,906 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-10 17:35:54,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:54,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360707070] [2024-11-10 17:35:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360707070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:54,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59836238] [2024-11-10 17:35:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:35:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:35:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:54,908 INFO L87 Difference]: Start difference. First operand 1926 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:54,940 INFO L93 Difference]: Finished difference Result 1884 states and 2137 transitions. [2024-11-10 17:35:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:35:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 17:35:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:54,946 INFO L225 Difference]: With dead ends: 1884 [2024-11-10 17:35:54,947 INFO L226 Difference]: Without dead ends: 1884 [2024-11-10 17:35:54,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:35:54,948 INFO L432 NwaCegarLoop]: 1784 mSDtfsCounter, 71 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3504 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-10 17:35:54,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3504 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-10 17:35:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2024-11-10 17:35:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1096 states have (on average 1.927919708029197) internal successors, (2113), 1874 states have internal predecessors, (2113), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2137 transitions. [2024-11-10 17:35:54,978 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2137 transitions. Word has length 13 [2024-11-10 17:35:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:54,979 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2137 transitions. [2024-11-10 17:35:54,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2137 transitions. [2024-11-10 17:35:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:35:54,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:54,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:54,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:35:55,180 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-10 17:35:55,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr884REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash 263459624, now seen corresponding path program 1 times [2024-11-10 17:35:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550416104] [2024-11-10 17:35:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:55,183 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-10 17:35:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:55,185 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-10 17:35:55,186 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-10 17:35:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:55,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:35:55,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:55,337 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-10 17:35:55,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:55,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550416104] [2024-11-10 17:35:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550416104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:55,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:55,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:35:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125653023] [2024-11-10 17:35:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:55,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:55,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:55,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:55,340 INFO L87 Difference]: Start difference. First operand 1884 states and 2137 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:55,403 INFO L93 Difference]: Finished difference Result 1862 states and 2108 transitions. [2024-11-10 17:35:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:35:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:35:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:55,408 INFO L225 Difference]: With dead ends: 1862 [2024-11-10 17:35:55,409 INFO L226 Difference]: Without dead ends: 1862 [2024-11-10 17:35:55,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:35:55,409 INFO L432 NwaCegarLoop]: 1739 mSDtfsCounter, 48 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5190 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:55,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5190 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:35:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-11-10 17:35:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2024-11-10 17:35:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1088 states have (on average 1.9154411764705883) internal successors, (2084), 1852 states have internal predecessors, (2084), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2108 transitions. [2024-11-10 17:35:55,446 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2108 transitions. Word has length 15 [2024-11-10 17:35:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:55,446 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2108 transitions. [2024-11-10 17:35:55,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:55,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2108 transitions. [2024-11-10 17:35:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:35:55,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:55,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:55,458 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-10 17:35:55,651 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-10 17:35:55,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr870REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash -625185474, now seen corresponding path program 1 times [2024-11-10 17:35:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945164454] [2024-11-10 17:35:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:55,653 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-10 17:35:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:55,655 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-10 17:35:55,657 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-10 17:35:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:55,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:35:55,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:55,804 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-10 17:35:55,860 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-10 17:35:55,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:55,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:55,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945164454] [2024-11-10 17:35:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945164454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:55,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:55,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739770424] [2024-11-10 17:35:55,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:55,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:55,862 INFO L87 Difference]: Start difference. First operand 1862 states and 2108 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:35:57,999 INFO L93 Difference]: Finished difference Result 1862 states and 2108 transitions. [2024-11-10 17:35:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:35:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 17:35:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:35:58,004 INFO L225 Difference]: With dead ends: 1862 [2024-11-10 17:35:58,005 INFO L226 Difference]: Without dead ends: 1862 [2024-11-10 17:35:58,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:35:58,005 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1227 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:35:58,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 2157 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:35:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2024-11-10 17:35:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1858. [2024-11-10 17:35:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1088 states have (on average 1.911764705882353) internal successors, (2080), 1848 states have internal predecessors, (2080), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:35:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2104 transitions. [2024-11-10 17:35:58,028 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2104 transitions. Word has length 29 [2024-11-10 17:35:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:35:58,028 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2104 transitions. [2024-11-10 17:35:58,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:35:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2104 transitions. [2024-11-10 17:35:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:35:58,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:35:58,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:35:58,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:35:58,229 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-10 17:35:58,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr871REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:35:58,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:35:58,230 INFO L85 PathProgramCache]: Analyzing trace with hash -625185473, now seen corresponding path program 1 times [2024-11-10 17:35:58,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:35:58,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43853456] [2024-11-10 17:35:58,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:35:58,230 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-10 17:35:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:35:58,231 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-10 17:35:58,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 (9)] Waiting until timeout for monitored process [2024-11-10 17:35:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:35:58,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:35:58,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:35:58,394 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-10 17:35:58,558 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-10 17:35:58,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:35:58,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:35:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43853456] [2024-11-10 17:35:58,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43853456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:35:58,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:35:58,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:35:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715136402] [2024-11-10 17:35:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:35:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:35:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:35:58,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:35:58,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:35:58,560 INFO L87 Difference]: Start difference. First operand 1858 states and 2104 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:01,740 INFO L93 Difference]: Finished difference Result 2247 states and 2391 transitions. [2024-11-10 17:36:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:36:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 17:36:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:01,745 INFO L225 Difference]: With dead ends: 2247 [2024-11-10 17:36:01,746 INFO L226 Difference]: Without dead ends: 2247 [2024-11-10 17:36:01,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:36:01,747 INFO L432 NwaCegarLoop]: 1469 mSDtfsCounter, 719 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:01,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3179 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 17:36:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-10 17:36:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1854. [2024-11-10 17:36:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1088 states have (on average 1.9080882352941178) internal successors, (2076), 1844 states have internal predecessors, (2076), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:36:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2100 transitions. [2024-11-10 17:36:01,775 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2100 transitions. Word has length 29 [2024-11-10 17:36:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:01,775 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2100 transitions. [2024-11-10 17:36:01,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2100 transitions. [2024-11-10 17:36:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 17:36:01,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:01,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:01,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-10 17:36:01,977 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-10 17:36:01,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr856REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:01,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1694067996, now seen corresponding path program 1 times [2024-11-10 17:36:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220031492] [2024-11-10 17:36:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:01,978 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-10 17:36:01,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:01,980 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-10 17:36:01,981 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-10 17:36:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:02,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:36:02,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:02,234 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-10 17:36:02,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:36:02,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:02,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220031492] [2024-11-10 17:36:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220031492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:36:02,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:36:02,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:36:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821968322] [2024-11-10 17:36:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:36:02,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:36:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:02,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:36:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:36:02,235 INFO L87 Difference]: Start difference. First operand 1854 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:02,293 INFO L93 Difference]: Finished difference Result 1848 states and 2090 transitions. [2024-11-10 17:36:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:36:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 17:36:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:02,297 INFO L225 Difference]: With dead ends: 1848 [2024-11-10 17:36:02,298 INFO L226 Difference]: Without dead ends: 1848 [2024-11-10 17:36:02,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:36:02,300 INFO L432 NwaCegarLoop]: 1733 mSDtfsCounter, 21 mSDsluCounter, 3434 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:02,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5167 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:36:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2024-11-10 17:36:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1848. [2024-11-10 17:36:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1082 states have (on average 1.9094269870609981) internal successors, (2066), 1838 states have internal predecessors, (2066), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:36:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2090 transitions. [2024-11-10 17:36:02,323 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2090 transitions. Word has length 46 [2024-11-10 17:36:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:02,324 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2090 transitions. [2024-11-10 17:36:02,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2090 transitions. [2024-11-10 17:36:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 17:36:02,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:02,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:02,331 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-10 17:36:02,530 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-10 17:36:02,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr856REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1413309484, now seen corresponding path program 1 times [2024-11-10 17:36:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663993061] [2024-11-10 17:36:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:02,531 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-10 17:36:02,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:02,534 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-10 17:36:02,535 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-10 17:36:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:02,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:36:02,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:02,943 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-10 17:36:02,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:36:02,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663993061] [2024-11-10 17:36:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663993061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:36:02,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:36:02,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:36:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392536112] [2024-11-10 17:36:02,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:36:02,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:36:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:02,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:36:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:36:02,944 INFO L87 Difference]: Start difference. First operand 1848 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:03,089 INFO L93 Difference]: Finished difference Result 2259 states and 2538 transitions. [2024-11-10 17:36:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:36:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-10 17:36:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:03,095 INFO L225 Difference]: With dead ends: 2259 [2024-11-10 17:36:03,095 INFO L226 Difference]: Without dead ends: 2259 [2024-11-10 17:36:03,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:36:03,095 INFO L432 NwaCegarLoop]: 1821 mSDtfsCounter, 377 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 3503 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:03,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 3503 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:36:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2024-11-10 17:36:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1897. [2024-11-10 17:36:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1131 states have (on average 1.870026525198939) internal successors, (2115), 1887 states have internal predecessors, (2115), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:36:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2139 transitions. [2024-11-10 17:36:03,119 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2139 transitions. Word has length 54 [2024-11-10 17:36:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:03,119 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2139 transitions. [2024-11-10 17:36:03,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2139 transitions. [2024-11-10 17:36:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 17:36:03,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:03,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:03,130 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-10 17:36:03,321 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-10 17:36:03,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr827REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:03,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -338938751, now seen corresponding path program 1 times [2024-11-10 17:36:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592369923] [2024-11-10 17:36:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:03,324 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-10 17:36:03,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:03,332 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-10 17:36:03,333 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-10 17:36:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:03,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:36:03,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:03,647 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-10 17:36:03,654 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-10 17:36:04,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:36:04,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 17:36:04,061 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:36:04,062 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-10 17:36:04,075 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-10 17:36:04,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:36:04,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592369923] [2024-11-10 17:36:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592369923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:36:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:36:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:36:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379439891] [2024-11-10 17:36:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:36:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:36:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:36:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:36:04,078 INFO L87 Difference]: Start difference. First operand 1897 states and 2139 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:06,469 INFO L93 Difference]: Finished difference Result 1813 states and 2055 transitions. [2024-11-10 17:36:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:36:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-10 17:36:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:06,474 INFO L225 Difference]: With dead ends: 1813 [2024-11-10 17:36:06,474 INFO L226 Difference]: Without dead ends: 1813 [2024-11-10 17:36:06,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:36:06,475 INFO L432 NwaCegarLoop]: 863 mSDtfsCounter, 1152 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:06,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1209 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:36:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-10 17:36:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1629. [2024-11-10 17:36:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 947 states have (on average 1.7888067581837381) internal successors, (1694), 1619 states have internal predecessors, (1694), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:36:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 1718 transitions. [2024-11-10 17:36:06,493 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 1718 transitions. Word has length 57 [2024-11-10 17:36:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:06,493 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 1718 transitions. [2024-11-10 17:36:06,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 1718 transitions. [2024-11-10 17:36:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 17:36:06,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:06,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:06,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 17:36:06,695 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-10 17:36:06,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr820REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:06,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1844765473, now seen corresponding path program 1 times [2024-11-10 17:36:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226271504] [2024-11-10 17:36:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:06,697 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-10 17:36:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:06,700 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-10 17:36:06,701 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-10 17:36:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:06,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:36:06,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:06,926 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-10 17:36:06,935 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 19 treesize of output 1 [2024-11-10 17:36:06,953 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 23 treesize of output 11 [2024-11-10 17:36:06,960 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-10 17:36:06,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:36:06,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226271504] [2024-11-10 17:36:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226271504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:36:06,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:36:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:36:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670376238] [2024-11-10 17:36:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:36:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:36:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:36:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:36:06,962 INFO L87 Difference]: Start difference. First operand 1629 states and 1718 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:09,452 INFO L93 Difference]: Finished difference Result 1628 states and 1717 transitions. [2024-11-10 17:36:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:36:09,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 17:36:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:09,456 INFO L225 Difference]: With dead ends: 1628 [2024-11-10 17:36:09,456 INFO L226 Difference]: Without dead ends: 1628 [2024-11-10 17:36:09,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:36:09,457 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 2 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:09,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4303 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:36:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-10 17:36:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1628. [2024-11-10 17:36:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 947 states have (on average 1.787750791974657) internal successors, (1693), 1618 states have internal predecessors, (1693), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:36:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1717 transitions. [2024-11-10 17:36:09,470 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1717 transitions. Word has length 62 [2024-11-10 17:36:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:09,471 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 1717 transitions. [2024-11-10 17:36:09,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1717 transitions. [2024-11-10 17:36:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 17:36:09,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:09,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:09,482 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-10 17:36:09,672 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-10 17:36:09,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr821REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1844765472, now seen corresponding path program 1 times [2024-11-10 17:36:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839679590] [2024-11-10 17:36:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:36:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:09,677 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-10 17:36:09,680 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-10 17:36:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:09,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 17:36:09,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:09,937 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-10 17:36:09,950 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 13 treesize of output 9 [2024-11-10 17:36:09,958 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 19 treesize of output 1 [2024-11-10 17:36:09,983 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 21 treesize of output 9 [2024-11-10 17:36:09,994 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-10 17:36:09,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:36:09,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839679590] [2024-11-10 17:36:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839679590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:36:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:36:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:36:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440161886] [2024-11-10 17:36:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:36:09,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:36:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:36:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:36:09,996 INFO L87 Difference]: Start difference. First operand 1628 states and 1717 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:13,083 INFO L93 Difference]: Finished difference Result 1627 states and 1716 transitions. [2024-11-10 17:36:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:36:13,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 17:36:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:13,087 INFO L225 Difference]: With dead ends: 1627 [2024-11-10 17:36:13,087 INFO L226 Difference]: Without dead ends: 1627 [2024-11-10 17:36:13,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:36:13,088 INFO L432 NwaCegarLoop]: 1660 mSDtfsCounter, 1 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:13,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4373 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 17:36:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-10 17:36:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2024-11-10 17:36:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 946 states have (on average 1.7885835095137421) internal successors, (1692), 1617 states have internal predecessors, (1692), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:36:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1716 transitions. [2024-11-10 17:36:13,101 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1716 transitions. Word has length 62 [2024-11-10 17:36:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 1716 transitions. [2024-11-10 17:36:13,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:36:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1716 transitions. [2024-11-10 17:36:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:36:13,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:13,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:13,109 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-10 17:36:13,303 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-10 17:36:13,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:13,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -79894180, now seen corresponding path program 1 times [2024-11-10 17:36:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:13,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931855758] [2024-11-10 17:36:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:13,304 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-10 17:36:13,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:13,307 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-10 17:36:13,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 17:36:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:13,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:36:13,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:13,550 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-10 17:36:13,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:36:13,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931855758] [2024-11-10 17:36:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931855758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:36:13,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:36:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:36:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256623112] [2024-11-10 17:36:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:36:13,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:36:13,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:13,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:36:13,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:36:13,553 INFO L87 Difference]: Start difference. First operand 1627 states and 1716 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-10 17:36:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:13,603 INFO L93 Difference]: Finished difference Result 1630 states and 1721 transitions. [2024-11-10 17:36:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:36:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 70 [2024-11-10 17:36:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:13,611 INFO L225 Difference]: With dead ends: 1630 [2024-11-10 17:36:13,614 INFO L226 Difference]: Without dead ends: 1630 [2024-11-10 17:36:13,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:36:13,614 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 0 mSDsluCounter, 3310 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4969 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:13,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4969 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:36:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-11-10 17:36:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2024-11-10 17:36:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 948 states have (on average 1.7879746835443038) internal successors, (1695), 1620 states have internal predecessors, (1695), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 17:36:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1721 transitions. [2024-11-10 17:36:13,643 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1721 transitions. Word has length 70 [2024-11-10 17:36:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 1721 transitions. [2024-11-10 17:36:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-10 17:36:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1721 transitions. [2024-11-10 17:36:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 17:36:13,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:13,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:13,652 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-10 17:36:13,848 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-10 17:36:13,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1082824869, now seen corresponding path program 1 times [2024-11-10 17:36:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539519026] [2024-11-10 17:36:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:36:13,849 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-10 17:36:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:13,851 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-10 17:36:13,860 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-10 17:36:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:36:14,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:36:14,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:14,089 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-10 17:36:14,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:36:14,134 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-10 17:36:14,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539519026] [2024-11-10 17:36:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539519026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:36:14,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:36:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:36:14,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211464200] [2024-11-10 17:36:14,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:36:14,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:36:14,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:14,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:36:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:36:14,136 INFO L87 Difference]: Start difference. First operand 1630 states and 1721 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:14,265 INFO L93 Difference]: Finished difference Result 1642 states and 1739 transitions. [2024-11-10 17:36:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:36:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-10 17:36:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:14,269 INFO L225 Difference]: With dead ends: 1642 [2024-11-10 17:36:14,270 INFO L226 Difference]: Without dead ends: 1642 [2024-11-10 17:36:14,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:36:14,271 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 6 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4969 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:14,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4969 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:36:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-10 17:36:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1640. [2024-11-10 17:36:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 957 states have (on average 1.786833855799373) internal successors, (1710), 1629 states have internal predecessors, (1710), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 17:36:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 1736 transitions. [2024-11-10 17:36:14,296 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 1736 transitions. Word has length 71 [2024-11-10 17:36:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:14,296 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 1736 transitions. [2024-11-10 17:36:14,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1736 transitions. [2024-11-10 17:36:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 17:36:14,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:14,298 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:36:14,309 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 (16)] Forceful destruction successful, exit code 0 [2024-11-10 17:36:14,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:36:14,498 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2073300708, now seen corresponding path program 2 times [2024-11-10 17:36:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104566782] [2024-11-10 17:36:14,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:36:14,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:36:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:14,500 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:36:14,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:36:14,883 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:36:14,883 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:36:14,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:36:14,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:36:14,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:36:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:36:15,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104566782] [2024-11-10 17:36:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104566782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:36:15,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:36:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:36:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760285769] [2024-11-10 17:36:15,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:36:15,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:36:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:36:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:36:15,042 INFO L87 Difference]: Start difference. First operand 1640 states and 1736 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:15,459 INFO L93 Difference]: Finished difference Result 1655 states and 1759 transitions. [2024-11-10 17:36:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:36:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-11-10 17:36:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:15,466 INFO L225 Difference]: With dead ends: 1655 [2024-11-10 17:36:15,466 INFO L226 Difference]: Without dead ends: 1651 [2024-11-10 17:36:15,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:36:15,467 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 13 mSDsluCounter, 8274 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9932 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:15,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9932 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 17:36:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2024-11-10 17:36:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2024-11-10 17:36:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 966 states have (on average 1.7826086956521738) internal successors, (1722), 1638 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 17:36:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 1748 transitions. [2024-11-10 17:36:15,492 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 1748 transitions. Word has length 74 [2024-11-10 17:36:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:15,492 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 1748 transitions. [2024-11-10 17:36:15,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1748 transitions. [2024-11-10 17:36:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:36:15,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:15,493 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:36:15,511 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 (17)] Forceful destruction successful, exit code 0 [2024-11-10 17:36:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:36:15,694 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:15,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash 504559804, now seen corresponding path program 3 times [2024-11-10 17:36:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090795890] [2024-11-10 17:36:15,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:36:15,695 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-10 17:36:15,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:15,696 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-10 17:36:15,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 17:36:16,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:36:16,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:36:16,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:36:16,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:36:16,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:36:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:36:16,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090795890] [2024-11-10 17:36:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090795890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:36:16,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:36:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:36:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016703372] [2024-11-10 17:36:16,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:36:16,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:36:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:36:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:36:16,736 INFO L87 Difference]: Start difference. First operand 1649 states and 1748 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:18,045 INFO L93 Difference]: Finished difference Result 1673 states and 1787 transitions. [2024-11-10 17:36:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:36:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-11-10 17:36:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:18,051 INFO L225 Difference]: With dead ends: 1673 [2024-11-10 17:36:18,051 INFO L226 Difference]: Without dead ends: 1667 [2024-11-10 17:36:18,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:36:18,052 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 17 mSDsluCounter, 19856 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21515 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:18,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21515 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:36:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-10 17:36:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-11-10 17:36:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 984 states have (on average 1.7733739837398375) internal successors, (1745), 1656 states have internal predecessors, (1745), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 17:36:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 1771 transitions. [2024-11-10 17:36:18,069 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 1771 transitions. Word has length 80 [2024-11-10 17:36:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:18,069 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 1771 transitions. [2024-11-10 17:36:18,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1771 transitions. [2024-11-10 17:36:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:36:18,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:18,070 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:36:18,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 17:36:18,270 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-10 17:36:18,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -130654212, now seen corresponding path program 4 times [2024-11-10 17:36:18,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178787928] [2024-11-10 17:36:18,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:36:18,272 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-10 17:36:18,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:18,273 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-10 17:36:18,274 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-10 17:36:18,676 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:36:18,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:36:18,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:36:18,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:36:18,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:36:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:36:19,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178787928] [2024-11-10 17:36:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178787928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:36:19,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:36:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:36:19,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106771622] [2024-11-10 17:36:19,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:36:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:36:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:36:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:36:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:36:19,973 INFO L87 Difference]: Start difference. First operand 1667 states and 1771 transitions. Second operand has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:36:24,314 INFO L93 Difference]: Finished difference Result 1707 states and 1844 transitions. [2024-11-10 17:36:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:36:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-10 17:36:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:36:24,317 INFO L225 Difference]: With dead ends: 1707 [2024-11-10 17:36:24,317 INFO L226 Difference]: Without dead ends: 1703 [2024-11-10 17:36:24,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:36:24,319 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 44 mSDsluCounter, 39697 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 41355 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:36:24,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 41355 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:36:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-10 17:36:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2024-11-10 17:36:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1018 states have (on average 1.7593320235756384) internal successors, (1791), 1690 states have internal predecessors, (1791), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-10 17:36:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1817 transitions. [2024-11-10 17:36:24,335 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1817 transitions. Word has length 92 [2024-11-10 17:36:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:36:24,335 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 1817 transitions. [2024-11-10 17:36:24,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:36:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1817 transitions. [2024-11-10 17:36:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 17:36:24,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:36:24,336 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 17:36:24,349 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-10 17:36:24,540 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-10 17:36:24,541 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr816REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-10 17:36:24,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:36:24,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1074994844, now seen corresponding path program 5 times [2024-11-10 17:36:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:36:24,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334579581] [2024-11-10 17:36:24,542 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:36:24,542 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-10 17:36:24,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:36:24,543 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-10 17:36:24,544 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-10 17:36:25,595 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:36:25,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:36:25,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 17:36:25,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:36:25,626 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-10 17:36:25,698 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 17:36:25,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 17:36:25,719 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 19 treesize of output 1 [2024-11-10 17:36:25,801 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 24 treesize of output 12 [2024-11-10 17:36:26,616 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:36:26,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-10 17:36:26,651 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 33 treesize of output 15 [2024-11-10 17:36:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:36:26,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:36:27,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:36:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334579581] [2024-11-10 17:36:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334579581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:36:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [451741591] [2024-11-10 17:36:27,029 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:36:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:36:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:36:27,033 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:36:27,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process