./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:03:56,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:03:56,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:03:56,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:03:56,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:03:56,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:03:56,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:03:56,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:03:56,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:03:56,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:03:56,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:03:56,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:03:56,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:03:56,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:03:56,858 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:03:56,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:03:56,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:03:56,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:03:56,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:03:56,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:03:56,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:03:56,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:03:56,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:03:56,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:03:56,864 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:03:56,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:03:56,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:03:56,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:03:56,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:03:56,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:03:56,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:03:56,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:03:56,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:03:56,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:03:56,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:03:56,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:03:56,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:03:56,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:03:56,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:03:56,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:03:56,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:03:56,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:03:56,870 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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2024-10-14 19:03:57,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:03:57,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:03:57,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:03:57,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:03:57,153 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:03:57,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-10-14 19:03:58,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:03:58,896 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:03:58,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-10-14 19:03:58,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fbc03c4/b8de95067ce340c1b70513473d9d0131/FLAGf2d9445fb [2024-10-14 19:03:58,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fbc03c4/b8de95067ce340c1b70513473d9d0131 [2024-10-14 19:03:58,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:03:58,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:03:58,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:03:58,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:03:58,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:03:58,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:03:58" (1/1) ... [2024-10-14 19:03:58,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ac04f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:03:58, skipping insertion in model container [2024-10-14 19:03:58,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:03:58" (1/1) ... [2024-10-14 19:03:59,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:03:59,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:03:59,567 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-10-14 19:03:59,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@24096db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:03:59, skipping insertion in model container [2024-10-14 19:03:59,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:03:59,569 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:03:59,571 INFO L158 Benchmark]: Toolchain (without parser) took 626.67ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 79.7MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 19:03:59,572 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:03:59,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.47ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 79.7MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 19:03:59,574 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.18ms. Allocated memory is still 159.4MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.47ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 79.7MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:04:01,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:04:01,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:04:01,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:04:01,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:04:01,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:04:01,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:04:01,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:04:01,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:04:01,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:04:01,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:04:01,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:04:01,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:04:01,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:04:01,671 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:04:01,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:04:01,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:04:01,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:04:01,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:04:01,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:04:01,673 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:04:01,674 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:04:01,674 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:04:01,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:04:01,675 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:04:01,675 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:04:01,675 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:04:01,676 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:04:01,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:04:01,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:04:01,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:04:01,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:04:01,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:04:01,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:04:01,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:04:01,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:04:01,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:04:01,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:04:01,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:04:01,679 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:04:01,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:04:01,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:04:01,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:04:01,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:04:01,681 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:04:01,681 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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2024-10-14 19:04:02,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:04:02,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:04:02,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:04:02,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:04:02,040 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:04:02,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-10-14 19:04:03,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:04:03,817 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:04:03,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-10-14 19:04:03,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7cdb372/4200eeee5249441496836a79ac07f31c/FLAG1d444e378 [2024-10-14 19:04:04,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a7cdb372/4200eeee5249441496836a79ac07f31c [2024-10-14 19:04:04,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:04:04,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:04:04,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:04:04,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:04:04,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:04:04,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:04:04" (1/1) ... [2024-10-14 19:04:04,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b389f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:04, skipping insertion in model container [2024-10-14 19:04:04,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:04:04" (1/1) ... [2024-10-14 19:04:04,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:04:04,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:04:04,776 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:04:04,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:04:04,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:04:04,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:04:04,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:04:05,010 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:04:05,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05 WrapperNode [2024-10-14 19:04:05,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:04:05,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:04:05,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:04:05,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:04:05,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,116 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-10-14 19:04:05,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:04:05,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:04:05,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:04:05,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:04:05,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,238 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-14 19:04:05,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:04:05,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:04:05,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:04:05,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:04:05,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (1/1) ... [2024-10-14 19:04:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:04:05,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:04:05,353 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-10-14 19:04:05,356 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-10-14 19:04:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:04:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:04:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:04:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:04:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:04:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:04:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:04:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:04:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:04:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:04:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:04:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:04:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:04:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:04:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:04:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:04:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 19:04:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:04:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:04:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:04:05,640 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:04:05,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:04:05,664 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:04:05,698 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:04:05,720 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:04:09,370 INFO L? ?]: Removed 1101 outVars from TransFormulas that were not future-live. [2024-10-14 19:04:09,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:04:09,541 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:04:09,542 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 19:04:09,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:04:09 BoogieIcfgContainer [2024-10-14 19:04:09,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:04:09,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:04:09,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:04:09,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:04:09,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:04:04" (1/3) ... [2024-10-14 19:04:09,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c3a420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:04:09, skipping insertion in model container [2024-10-14 19:04:09,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:04:05" (2/3) ... [2024-10-14 19:04:09,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c3a420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:04:09, skipping insertion in model container [2024-10-14 19:04:09,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:04:09" (3/3) ... [2024-10-14 19:04:09,552 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-2.i [2024-10-14 19:04:09,569 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:04:09,569 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-10-14 19:04:09,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:04:09,653 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;@2247a309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:04:09,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-10-14 19:04:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 978 states, 438 states have (on average 2.5) internal successors, (1095), 971 states have internal predecessors, (1095), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 19:04:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:04:09,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:09,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:04:09,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:09,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 55623, now seen corresponding path program 1 times [2024-10-14 19:04:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749057171] [2024-10-14 19:04:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:09,688 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-10-14 19:04:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:09,691 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-10-14 19:04:09,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 (2)] Waiting until timeout for monitored process [2024-10-14 19:04:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:09,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:04:09,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:09,884 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-10-14 19:04:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:09,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:09,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749057171] [2024-10-14 19:04:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749057171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:09,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:04:09,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583991198] [2024-10-14 19:04:09,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:09,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:09,946 INFO L87 Difference]: Start difference. First operand has 978 states, 438 states have (on average 2.5) internal successors, (1095), 971 states have internal predecessors, (1095), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:04:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:11,833 INFO L93 Difference]: Finished difference Result 1128 states and 1205 transitions. [2024-10-14 19:04:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-14 19:04:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:11,854 INFO L225 Difference]: With dead ends: 1128 [2024-10-14 19:04:11,854 INFO L226 Difference]: Without dead ends: 1127 [2024-10-14 19:04:11,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 19:04:11,859 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 891 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:11,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 671 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:04:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-10-14 19:04:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 963. [2024-10-14 19:04:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 441 states have (on average 2.2970521541950113) internal successors, (1013), 956 states have internal predecessors, (1013), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:04:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1031 transitions. [2024-10-14 19:04:11,957 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1031 transitions. Word has length 2 [2024-10-14 19:04:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:11,958 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1031 transitions. [2024-10-14 19:04:11,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:04:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1031 transitions. [2024-10-14 19:04:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:04:11,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:11,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:04:11,963 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-10-14 19:04:12,161 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-10-14 19:04:12,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 55624, now seen corresponding path program 1 times [2024-10-14 19:04:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340264147] [2024-10-14 19:04:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:12,163 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-10-14 19:04:12,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:12,181 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-10-14 19:04:12,182 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-10-14 19:04:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:12,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:04:12,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:12,301 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-10-14 19:04:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:12,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:12,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:12,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340264147] [2024-10-14 19:04:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340264147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:12,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:12,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:04:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064215366] [2024-10-14 19:04:12,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:12,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:12,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:12,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:12,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:12,319 INFO L87 Difference]: Start difference. First operand 963 states and 1031 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:04:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:14,237 INFO L93 Difference]: Finished difference Result 1350 states and 1461 transitions. [2024-10-14 19:04:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:14,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-14 19:04:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:14,243 INFO L225 Difference]: With dead ends: 1350 [2024-10-14 19:04:14,243 INFO L226 Difference]: Without dead ends: 1350 [2024-10-14 19:04:14,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 19:04:14,244 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 419 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:14,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1261 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:04:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2024-10-14 19:04:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1079. [2024-10-14 19:04:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 553 states have (on average 2.236889692585895) internal successors, (1237), 1072 states have internal predecessors, (1237), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1265 transitions. [2024-10-14 19:04:14,287 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1265 transitions. Word has length 2 [2024-10-14 19:04:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:14,287 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1265 transitions. [2024-10-14 19:04:14,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:04:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1265 transitions. [2024-10-14 19:04:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:04:14,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:14,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:04:14,292 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-10-14 19:04:14,490 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-10-14 19:04:14,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:14,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash -170130095, now seen corresponding path program 1 times [2024-10-14 19:04:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212519730] [2024-10-14 19:04:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:04:14,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:14,495 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-10-14 19:04:14,496 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-10-14 19:04:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:14,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:04:14,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:14,636 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-10-14 19:04:14,642 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-10-14 19:04:14,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:04:14,702 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-10-14 19:04:14,720 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:04:14,720 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-10-14 19:04:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:14,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:14,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212519730] [2024-10-14 19:04:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212519730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:04:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255320063] [2024-10-14 19:04:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:14,747 INFO L87 Difference]: Start difference. First operand 1079 states and 1265 transitions. Second operand has 4 states, 3 states have (on average 2.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-10-14 19:04:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:17,226 INFO L93 Difference]: Finished difference Result 1232 states and 1426 transitions. [2024-10-14 19:04:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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-10-14 19:04:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:17,231 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 19:04:17,231 INFO L226 Difference]: Without dead ends: 1232 [2024-10-14 19:04:17,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-14 19:04:17,232 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 2033 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:17,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2041 Valid, 346 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 19:04:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2024-10-14 19:04:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 951. [2024-10-14 19:04:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 441 states have (on average 2.2675736961451247) internal successors, (1000), 944 states have internal predecessors, (1000), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:04:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1018 transitions. [2024-10-14 19:04:17,260 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1018 transitions. Word has length 6 [2024-10-14 19:04:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:17,261 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1018 transitions. [2024-10-14 19:04:17,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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-10-14 19:04:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1018 transitions. [2024-10-14 19:04:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:04:17,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:17,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:17,267 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-10-14 19:04:17,462 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-10-14 19:04:17,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash -979065647, now seen corresponding path program 1 times [2024-10-14 19:04:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161671666] [2024-10-14 19:04:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:17,464 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-10-14 19:04:17,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:17,466 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-10-14 19:04:17,467 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-10-14 19:04:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:17,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:04:17,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:17,601 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-10-14 19:04:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:17,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:17,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161671666] [2024-10-14 19:04:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161671666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:17,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:17,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:04:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045083941] [2024-10-14 19:04:17,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:17,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:17,629 INFO L87 Difference]: Start difference. First operand 951 states and 1018 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:04:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:19,725 INFO L93 Difference]: Finished difference Result 1219 states and 1325 transitions. [2024-10-14 19:04:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:19,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-14 19:04:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:19,730 INFO L225 Difference]: With dead ends: 1219 [2024-10-14 19:04:19,730 INFO L226 Difference]: Without dead ends: 1219 [2024-10-14 19:04:19,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-14 19:04:19,733 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 460 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:19,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1299 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 19:04:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-10-14 19:04:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 968. [2024-10-14 19:04:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 468 states have (on average 2.2606837606837606) internal successors, (1058), 961 states have internal predecessors, (1058), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:04:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1076 transitions. [2024-10-14 19:04:19,752 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1076 transitions. Word has length 7 [2024-10-14 19:04:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:19,753 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1076 transitions. [2024-10-14 19:04:19,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:04:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1076 transitions. [2024-10-14 19:04:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:04:19,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:19,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:19,759 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 19:04:19,954 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-10-14 19:04:19,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash -979065648, now seen corresponding path program 1 times [2024-10-14 19:04:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616903757] [2024-10-14 19:04:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:19,956 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-10-14 19:04:19,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:19,957 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-10-14 19:04:19,959 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-10-14 19:04:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:20,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:04:20,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:20,085 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-10-14 19:04:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:20,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:20,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:20,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616903757] [2024-10-14 19:04:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616903757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:20,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:20,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:04:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837754894] [2024-10-14 19:04:20,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:20,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:20,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:20,102 INFO L87 Difference]: Start difference. First operand 968 states and 1076 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:04:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:21,227 INFO L93 Difference]: Finished difference Result 1126 states and 1262 transitions. [2024-10-14 19:04:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-14 19:04:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:21,231 INFO L225 Difference]: With dead ends: 1126 [2024-10-14 19:04:21,231 INFO L226 Difference]: Without dead ends: 1126 [2024-10-14 19:04:21,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-14 19:04:21,232 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 681 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:21,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 988 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:04:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-10-14 19:04:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 921. [2024-10-14 19:04:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 468 states have (on average 2.1517094017094016) internal successors, (1007), 914 states have internal predecessors, (1007), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 19:04:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1025 transitions. [2024-10-14 19:04:21,256 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1025 transitions. Word has length 7 [2024-10-14 19:04:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:21,257 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1025 transitions. [2024-10-14 19:04:21,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:04:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1025 transitions. [2024-10-14 19:04:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 19:04:21,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:21,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:21,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:04:21,458 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-10-14 19:04:21,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:21,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1432976317, now seen corresponding path program 1 times [2024-10-14 19:04:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:21,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254780864] [2024-10-14 19:04:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:21,460 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-10-14 19:04:21,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:21,461 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-10-14 19:04:21,462 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-10-14 19:04:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:21,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:04:21,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:21,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:21,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254780864] [2024-10-14 19:04:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254780864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:04:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760958204] [2024-10-14 19:04:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:21,648 INFO L87 Difference]: Start difference. First operand 921 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-14 19:04:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:22,381 INFO L93 Difference]: Finished difference Result 1326 states and 1496 transitions. [2024-10-14 19:04:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-14 19:04:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:22,386 INFO L225 Difference]: With dead ends: 1326 [2024-10-14 19:04:22,386 INFO L226 Difference]: Without dead ends: 1326 [2024-10-14 19:04:22,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-14 19:04:22,388 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 431 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:22,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1665 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:04:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-10-14 19:04:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1075. [2024-10-14 19:04:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 617 states have (on average 2.081037277147488) internal successors, (1284), 1068 states have internal predecessors, (1284), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1312 transitions. [2024-10-14 19:04:22,411 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1312 transitions. Word has length 10 [2024-10-14 19:04:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:22,411 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1312 transitions. [2024-10-14 19:04:22,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-14 19:04:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1312 transitions. [2024-10-14 19:04:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:04:22,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:22,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:22,416 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-10-14 19:04:22,612 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-10-14 19:04:22,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:22,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1214525722, now seen corresponding path program 1 times [2024-10-14 19:04:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603680369] [2024-10-14 19:04:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:22,615 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-10-14 19:04:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:22,616 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-10-14 19:04:22,617 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-10-14 19:04:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:22,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:04:22,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:22,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:22,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603680369] [2024-10-14 19:04:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603680369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:04:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256225993] [2024-10-14 19:04:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:22,753 INFO L87 Difference]: Start difference. First operand 1075 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 19:04:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:23,262 INFO L93 Difference]: Finished difference Result 1021 states and 1232 transitions. [2024-10-14 19:04:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:23,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-14 19:04:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:23,267 INFO L225 Difference]: With dead ends: 1021 [2024-10-14 19:04:23,267 INFO L226 Difference]: Without dead ends: 1021 [2024-10-14 19:04:23,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-14 19:04:23,269 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 61 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:23,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1558 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:04:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-14 19:04:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2024-10-14 19:04:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 587 states have (on average 2.0511073253833048) internal successors, (1204), 1014 states have internal predecessors, (1204), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1232 transitions. [2024-10-14 19:04:23,285 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1232 transitions. Word has length 12 [2024-10-14 19:04:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1232 transitions. [2024-10-14 19:04:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 19:04:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1232 transitions. [2024-10-14 19:04:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 19:04:23,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:23,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:23,292 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-10-14 19:04:23,491 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-10-14 19:04:23,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:23,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2110353888, now seen corresponding path program 1 times [2024-10-14 19:04:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:23,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16238293] [2024-10-14 19:04:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:04:23,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:23,493 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-10-14 19:04:23,494 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-10-14 19:04:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:23,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:04:23,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:23,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:23,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16238293] [2024-10-14 19:04:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16238293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:23,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:04:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855865363] [2024-10-14 19:04:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:23,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:23,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:23,680 INFO L87 Difference]: Start difference. First operand 1021 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-10-14 19:04:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:24,675 INFO L93 Difference]: Finished difference Result 1250 states and 1418 transitions. [2024-10-14 19:04:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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-10-14 19:04:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:24,679 INFO L225 Difference]: With dead ends: 1250 [2024-10-14 19:04:24,679 INFO L226 Difference]: Without dead ends: 1250 [2024-10-14 19:04:24,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-10-14 19:04:24,680 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 394 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:24,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 2358 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:04:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-10-14 19:04:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1023. [2024-10-14 19:04:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 589 states have (on average 2.0475382003395586) internal successors, (1206), 1016 states have internal predecessors, (1206), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1234 transitions. [2024-10-14 19:04:24,696 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1234 transitions. Word has length 13 [2024-10-14 19:04:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1234 transitions. [2024-10-14 19:04:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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-10-14 19:04:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1234 transitions. [2024-10-14 19:04:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 19:04:24,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:24,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:24,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:04:24,897 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-10-14 19:04:24,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:24,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2110346978, now seen corresponding path program 1 times [2024-10-14 19:04:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141865805] [2024-10-14 19:04:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:24,899 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-10-14 19:04:24,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:24,900 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-10-14 19:04:24,902 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-10-14 19:04:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:25,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:04:25,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:25,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:04:25,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:04:25,060 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:04:25,063 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 30 treesize of output 39 [2024-10-14 19:04:25,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:04:25,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 19:04:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:25,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:25,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141865805] [2024-10-14 19:04:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141865805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:04:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704755569] [2024-10-14 19:04:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:25,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:25,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:25,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:25,119 INFO L87 Difference]: Start difference. First operand 1023 states and 1234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-14 19:04:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:26,309 INFO L93 Difference]: Finished difference Result 1775 states and 2009 transitions. [2024-10-14 19:04:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-14 19:04:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:26,314 INFO L225 Difference]: With dead ends: 1775 [2024-10-14 19:04:26,314 INFO L226 Difference]: Without dead ends: 1775 [2024-10-14 19:04:26,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-10-14 19:04:26,315 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 842 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:26,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2745 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:04:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-10-14 19:04:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1022. [2024-10-14 19:04:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 588 states have (on average 2.0476190476190474) internal successors, (1204), 1015 states have internal predecessors, (1204), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1232 transitions. [2024-10-14 19:04:26,334 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1232 transitions. Word has length 13 [2024-10-14 19:04:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1232 transitions. [2024-10-14 19:04:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-14 19:04:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1232 transitions. [2024-10-14 19:04:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:04:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:26,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:26,342 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-10-14 19:04:26,536 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-10-14 19:04:26,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:26,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1015086425, now seen corresponding path program 1 times [2024-10-14 19:04:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838983166] [2024-10-14 19:04:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:26,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-10-14 19:04:26,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:26,543 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-10-14 19:04:26,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:04:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:26,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:04:26,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:26,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:26,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838983166] [2024-10-14 19:04:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838983166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:04:26,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349830443] [2024-10-14 19:04:26,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:26,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:04:26,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:04:26,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:04:26,714 INFO L87 Difference]: Start difference. First operand 1022 states and 1232 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-10-14 19:04:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:27,199 INFO L93 Difference]: Finished difference Result 968 states and 1152 transitions. [2024-10-14 19:04:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:04:27,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-10-14 19:04:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:27,202 INFO L225 Difference]: With dead ends: 968 [2024-10-14 19:04:27,203 INFO L226 Difference]: Without dead ends: 968 [2024-10-14 19:04:27,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-14 19:04:27,203 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 61 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:27,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1484 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:04:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-14 19:04:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2024-10-14 19:04:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 558 states have (on average 2.014336917562724) internal successors, (1124), 961 states have internal predecessors, (1124), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1152 transitions. [2024-10-14 19:04:27,217 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1152 transitions. Word has length 15 [2024-10-14 19:04:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:27,217 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1152 transitions. [2024-10-14 19:04:27,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-10-14 19:04:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1152 transitions. [2024-10-14 19:04:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:04:27,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:27,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:04:27,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:04:27,419 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-10-14 19:04:27,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -540480991, now seen corresponding path program 1 times [2024-10-14 19:04:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542128142] [2024-10-14 19:04:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:27,420 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-10-14 19:04:27,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:27,423 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-10-14 19:04:27,424 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-10-14 19:04:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:27,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:04:27,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:27,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:27,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542128142] [2024-10-14 19:04:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542128142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:27,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:04:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794448979] [2024-10-14 19:04:27,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:27,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:27,573 INFO L87 Difference]: Start difference. First operand 968 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-14 19:04:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:28,139 INFO L93 Difference]: Finished difference Result 952 states and 1108 transitions. [2024-10-14 19:04:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:04:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-14 19:04:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:28,143 INFO L225 Difference]: With dead ends: 952 [2024-10-14 19:04:28,143 INFO L226 Difference]: Without dead ends: 952 [2024-10-14 19:04:28,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-10-14 19:04:28,143 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 45 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:28,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2178 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:04:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-14 19:04:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2024-10-14 19:04:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 556 states have (on average 1.9424460431654675) internal successors, (1080), 945 states have internal predecessors, (1080), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1108 transitions. [2024-10-14 19:04:28,156 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1108 transitions. Word has length 17 [2024-10-14 19:04:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:28,156 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1108 transitions. [2024-10-14 19:04:28,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-14 19:04:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1108 transitions. [2024-10-14 19:04:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:04:28,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:28,158 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] [2024-10-14 19:04:28,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 19:04:28,358 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-10-14 19:04:28,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:28,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1534247825, now seen corresponding path program 1 times [2024-10-14 19:04:28,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:28,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643487429] [2024-10-14 19:04:28,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:28,359 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-10-14 19:04:28,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:28,362 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-10-14 19:04:28,363 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-10-14 19:04:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:28,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:04:28,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:28,517 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-10-14 19:04:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:28,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:28,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643487429] [2024-10-14 19:04:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643487429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:04:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26144016] [2024-10-14 19:04:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:28,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:28,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:28,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:28,588 INFO L87 Difference]: Start difference. First operand 952 states and 1108 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:04:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:29,734 INFO L93 Difference]: Finished difference Result 956 states and 1108 transitions. [2024-10-14 19:04:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-14 19:04:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:29,736 INFO L225 Difference]: With dead ends: 956 [2024-10-14 19:04:29,736 INFO L226 Difference]: Without dead ends: 956 [2024-10-14 19:04:29,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-10-14 19:04:29,737 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 583 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:29,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 936 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:04:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-10-14 19:04:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 948. [2024-10-14 19:04:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 556 states have (on average 1.9280575539568345) internal successors, (1072), 941 states have internal predecessors, (1072), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1100 transitions. [2024-10-14 19:04:29,750 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1100 transitions. Word has length 31 [2024-10-14 19:04:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:29,750 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1100 transitions. [2024-10-14 19:04:29,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:04:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1100 transitions. [2024-10-14 19:04:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:04:29,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:29,751 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] [2024-10-14 19:04:29,758 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-10-14 19:04:29,952 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-10-14 19:04:29,952 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1534247824, now seen corresponding path program 1 times [2024-10-14 19:04:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50095210] [2024-10-14 19:04:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:29,954 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-10-14 19:04:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:29,957 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-10-14 19:04:29,958 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-10-14 19:04:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:30,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:04:30,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:30,123 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-10-14 19:04:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:30,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:30,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:30,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50095210] [2024-10-14 19:04:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50095210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:04:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062947297] [2024-10-14 19:04:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:30,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:30,291 INFO L87 Difference]: Start difference. First operand 948 states and 1100 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:04:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:32,044 INFO L93 Difference]: Finished difference Result 1231 states and 1425 transitions. [2024-10-14 19:04:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-14 19:04:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:32,048 INFO L225 Difference]: With dead ends: 1231 [2024-10-14 19:04:32,048 INFO L226 Difference]: Without dead ends: 1231 [2024-10-14 19:04:32,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-10-14 19:04:32,049 INFO L432 NwaCegarLoop]: 874 mSDtfsCounter, 358 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:32,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1752 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:04:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-10-14 19:04:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 944. [2024-10-14 19:04:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 556 states have (on average 1.9136690647482015) internal successors, (1064), 937 states have internal predecessors, (1064), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1092 transitions. [2024-10-14 19:04:32,062 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1092 transitions. Word has length 31 [2024-10-14 19:04:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1092 transitions. [2024-10-14 19:04:32,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:04:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1092 transitions. [2024-10-14 19:04:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 19:04:32,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:32,065 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] [2024-10-14 19:04:32,071 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-10-14 19:04:32,265 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-10-14 19:04:32,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:32,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1733807225, now seen corresponding path program 1 times [2024-10-14 19:04:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:32,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693118067] [2024-10-14 19:04:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:32,267 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-10-14 19:04:32,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:32,270 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-10-14 19:04:32,272 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-10-14 19:04:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:32,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:04:32,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:32,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:32,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:32,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693118067] [2024-10-14 19:04:32,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693118067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:32,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:32,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:04:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519917802] [2024-10-14 19:04:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:32,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:32,567 INFO L87 Difference]: Start difference. First operand 944 states and 1092 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10-14 19:04:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:33,089 INFO L93 Difference]: Finished difference Result 932 states and 1072 transitions. [2024-10-14 19:04:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:04:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-14 19:04:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:33,093 INFO L225 Difference]: With dead ends: 932 [2024-10-14 19:04:33,093 INFO L226 Difference]: Without dead ends: 932 [2024-10-14 19:04:33,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-10-14 19:04:33,093 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 15 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:33,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2161 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:04:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-14 19:04:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-10-14 19:04:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 544 states have (on average 1.9191176470588236) internal successors, (1044), 925 states have internal predecessors, (1044), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1072 transitions. [2024-10-14 19:04:33,104 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1072 transitions. Word has length 50 [2024-10-14 19:04:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:33,105 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1072 transitions. [2024-10-14 19:04:33,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10-14 19:04:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1072 transitions. [2024-10-14 19:04:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 19:04:33,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:33,106 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-10-14 19:04:33,113 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-10-14 19:04:33,306 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-10-14 19:04:33,307 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1202208248, now seen corresponding path program 1 times [2024-10-14 19:04:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309758806] [2024-10-14 19:04:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:33,308 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-10-14 19:04:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:33,311 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-10-14 19:04:33,312 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-10-14 19:04:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:33,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:04:33,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:33,593 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-10-14 19:04:33,599 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-10-14 19:04:34,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:04:34,024 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-10-14 19:04:34,038 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:04:34,038 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-10-14 19:04:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:34,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:34,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309758806] [2024-10-14 19:04:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309758806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:34,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:34,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:04:34,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790525119] [2024-10-14 19:04:34,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:34,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:34,051 INFO L87 Difference]: Start difference. First operand 932 states and 1072 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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-10-14 19:04:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:35,321 INFO L93 Difference]: Finished difference Result 894 states and 1034 transitions. [2024-10-14 19:04:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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-10-14 19:04:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:35,324 INFO L225 Difference]: With dead ends: 894 [2024-10-14 19:04:35,324 INFO L226 Difference]: Without dead ends: 894 [2024-10-14 19:04:35,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-10-14 19:04:35,325 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 516 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:35,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 510 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:04:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-14 19:04:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 867. [2024-10-14 19:04:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 517 states have (on average 1.8220502901353965) internal successors, (942), 860 states have internal predecessors, (942), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 970 transitions. [2024-10-14 19:04:35,335 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 970 transitions. Word has length 54 [2024-10-14 19:04:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:35,335 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 970 transitions. [2024-10-14 19:04:35,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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-10-14 19:04:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 970 transitions. [2024-10-14 19:04:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:04:35,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:35,336 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] [2024-10-14 19:04:35,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 19:04:35,537 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-10-14 19:04:35,537 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -307702477, now seen corresponding path program 1 times [2024-10-14 19:04:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:35,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501631837] [2024-10-14 19:04:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:35,538 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-10-14 19:04:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:35,539 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-10-14 19:04:35,540 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-10-14 19:04:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:35,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:04:35,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:35,779 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-10-14 19:04:35,789 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-10-14 19:04:35,814 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-10-14 19:04:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:35,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:35,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501631837] [2024-10-14 19:04:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501631837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:35,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:35,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:04:35,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094779444] [2024-10-14 19:04:35,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:35,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:04:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:04:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:04:35,825 INFO L87 Difference]: Start difference. First operand 867 states and 970 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:04:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:37,408 INFO L93 Difference]: Finished difference Result 866 states and 969 transitions. [2024-10-14 19:04:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:04:37,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:04:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:37,411 INFO L225 Difference]: With dead ends: 866 [2024-10-14 19:04:37,411 INFO L226 Difference]: Without dead ends: 866 [2024-10-14 19:04:37,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-10-14 19:04:37,412 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:37,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1865 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:04:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-14 19:04:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2024-10-14 19:04:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 517 states have (on average 1.8201160541586074) internal successors, (941), 859 states have internal predecessors, (941), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 969 transitions. [2024-10-14 19:04:37,421 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 969 transitions. Word has length 58 [2024-10-14 19:04:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 969 transitions. [2024-10-14 19:04:37,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:04:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 969 transitions. [2024-10-14 19:04:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:04:37,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:37,422 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] [2024-10-14 19:04:37,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-14 19:04:37,622 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-10-14 19:04:37,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:37,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:37,623 INFO L85 PathProgramCache]: Analyzing trace with hash -307702476, now seen corresponding path program 1 times [2024-10-14 19:04:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:37,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741385672] [2024-10-14 19:04:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:37,624 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-10-14 19:04:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:37,625 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-10-14 19:04:37,626 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-10-14 19:04:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:37,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:04:37,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:37,868 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-10-14 19:04:37,887 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-10-14 19:04:37,891 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-10-14 19:04:37,931 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-10-14 19:04:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:37,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:37,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741385672] [2024-10-14 19:04:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741385672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:04:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827182340] [2024-10-14 19:04:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:37,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:04:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:37,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:04:37,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:04:37,948 INFO L87 Difference]: Start difference. First operand 866 states and 969 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:04:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:39,667 INFO L93 Difference]: Finished difference Result 865 states and 968 transitions. [2024-10-14 19:04:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:04:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:04:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:39,671 INFO L225 Difference]: With dead ends: 865 [2024-10-14 19:04:39,671 INFO L226 Difference]: Without dead ends: 865 [2024-10-14 19:04:39,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-10-14 19:04:39,671 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 1 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:39,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1896 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:04:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-10-14 19:04:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2024-10-14 19:04:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 516 states have (on average 1.821705426356589) internal successors, (940), 858 states have internal predecessors, (940), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:04:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 968 transitions. [2024-10-14 19:04:39,681 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 968 transitions. Word has length 58 [2024-10-14 19:04:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:39,682 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 968 transitions. [2024-10-14 19:04:39,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:04:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 968 transitions. [2024-10-14 19:04:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:04:39,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:39,683 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] [2024-10-14 19:04:39,690 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-10-14 19:04:39,883 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-10-14 19:04:39,883 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:39,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1320478135, now seen corresponding path program 1 times [2024-10-14 19:04:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640372832] [2024-10-14 19:04:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:39,885 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-10-14 19:04:39,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:39,888 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-10-14 19:04:39,895 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-10-14 19:04:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:40,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:04:40,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:40,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:04:40,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:40,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640372832] [2024-10-14 19:04:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640372832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:04:40,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:04:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:04:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747292536] [2024-10-14 19:04:40,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:04:40,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:04:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:40,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:04:40,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:04:40,169 INFO L87 Difference]: Start difference. First operand 865 states and 968 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-10-14 19:04:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:40,692 INFO L93 Difference]: Finished difference Result 867 states and 971 transitions. [2024-10-14 19:04:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:04:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-14 19:04:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:40,698 INFO L225 Difference]: With dead ends: 867 [2024-10-14 19:04:40,698 INFO L226 Difference]: Without dead ends: 867 [2024-10-14 19:04:40,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-10-14 19:04:40,699 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 0 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:40,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2097 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:04:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-14 19:04:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2024-10-14 19:04:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 517 states have (on average 1.8220502901353965) internal successors, (942), 860 states have internal predecessors, (942), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:04:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 971 transitions. [2024-10-14 19:04:40,712 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 971 transitions. Word has length 64 [2024-10-14 19:04:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:40,713 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 971 transitions. [2024-10-14 19:04:40,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-10-14 19:04:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 971 transitions. [2024-10-14 19:04:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:04:40,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:40,714 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] [2024-10-14 19:04:40,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-14 19:04:40,914 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-10-14 19:04:40,914 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -259550089, now seen corresponding path program 1 times [2024-10-14 19:04:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880190485] [2024-10-14 19:04:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:04:40,915 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-10-14 19:04:40,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:40,917 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-10-14 19:04:40,918 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-10-14 19:04:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:04:41,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:04:41,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:41,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:04:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:41,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880190485] [2024-10-14 19:04:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880190485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:04:41,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:04:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:04:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039566864] [2024-10-14 19:04:41,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:04:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:04:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:04:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:04:41,244 INFO L87 Difference]: Start difference. First operand 867 states and 971 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-10-14 19:04:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:42,338 INFO L93 Difference]: Finished difference Result 876 states and 985 transitions. [2024-10-14 19:04:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:04:42,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-14 19:04:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:42,342 INFO L225 Difference]: With dead ends: 876 [2024-10-14 19:04:42,342 INFO L226 Difference]: Without dead ends: 876 [2024-10-14 19:04:42,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 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-10-14 19:04:42,342 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 4 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4881 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:42,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4881 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:04:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-14 19:04:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 875. [2024-10-14 19:04:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 524 states have (on average 1.8225190839694656) internal successors, (955), 867 states have internal predecessors, (955), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:04:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 984 transitions. [2024-10-14 19:04:42,353 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 984 transitions. Word has length 65 [2024-10-14 19:04:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:42,354 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 984 transitions. [2024-10-14 19:04:42,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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-10-14 19:04:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 984 transitions. [2024-10-14 19:04:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 19:04:42,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:42,354 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] [2024-10-14 19:04:42,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-14 19:04:42,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:04:42,555 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:42,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2058709577, now seen corresponding path program 2 times [2024-10-14 19:04:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:42,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748526558] [2024-10-14 19:04:42,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:04:42,556 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-10-14 19:04:42,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:42,558 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:04:42,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 19:04:42,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:04:42,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:04:42,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:04:42,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:43,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:04:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:43,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748526558] [2024-10-14 19:04:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748526558] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:04:43,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:04:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:04:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047660672] [2024-10-14 19:04:43,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:04:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:04:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:04:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:04:43,170 INFO L87 Difference]: Start difference. First operand 875 states and 984 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-10-14 19:04:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:44,616 INFO L93 Difference]: Finished difference Result 887 states and 1003 transitions. [2024-10-14 19:04:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:04:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2024-10-14 19:04:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:44,620 INFO L225 Difference]: With dead ends: 887 [2024-10-14 19:04:44,620 INFO L226 Difference]: Without dead ends: 885 [2024-10-14 19:04:44,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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-10-14 19:04:44,621 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 7 mSDsluCounter, 4883 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5582 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:44,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5582 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:04:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-14 19:04:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 884. [2024-10-14 19:04:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 533 states have (on average 1.8142589118198875) internal successors, (967), 876 states have internal predecessors, (967), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:04:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 996 transitions. [2024-10-14 19:04:44,635 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 996 transitions. Word has length 68 [2024-10-14 19:04:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 996 transitions. [2024-10-14 19:04:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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-10-14 19:04:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 996 transitions. [2024-10-14 19:04:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 19:04:44,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:44,636 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] [2024-10-14 19:04:44,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-14 19:04:44,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:04:44,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash -326754889, now seen corresponding path program 3 times [2024-10-14 19:04:44,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:44,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20564776] [2024-10-14 19:04:44,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:04:44,838 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-10-14 19:04:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:44,839 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:04:44,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 19:04:45,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:04:45,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:04:45,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:04:45,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:45,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:04:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:46,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20564776] [2024-10-14 19:04:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20564776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:04:46,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:04:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:04:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193831730] [2024-10-14 19:04:46,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:04:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:04:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:04:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:04:46,038 INFO L87 Difference]: Start difference. First operand 884 states and 996 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-10-14 19:04:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:49,112 INFO L93 Difference]: Finished difference Result 905 states and 1032 transitions. [2024-10-14 19:04:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:04:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-10-14 19:04:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:49,115 INFO L225 Difference]: With dead ends: 905 [2024-10-14 19:04:49,115 INFO L226 Difference]: Without dead ends: 902 [2024-10-14 19:04:49,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:04:49,116 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 13 mSDsluCounter, 7676 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8375 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:49,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8375 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 19:04:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-14 19:04:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-10-14 19:04:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 551 states have (on average 1.7967332123411979) internal successors, (990), 894 states have internal predecessors, (990), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:04:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1019 transitions. [2024-10-14 19:04:49,131 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1019 transitions. Word has length 74 [2024-10-14 19:04:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:49,131 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1019 transitions. [2024-10-14 19:04:49,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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-10-14 19:04:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1019 transitions. [2024-10-14 19:04:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:04:49,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:49,132 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] [2024-10-14 19:04:49,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-14 19:04:49,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:04:49,337 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:04:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:04:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 220933559, now seen corresponding path program 4 times [2024-10-14 19:04:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:04:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910704262] [2024-10-14 19:04:49,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:04:49,338 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-10-14 19:04:49,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:04:49,339 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:04:49,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 19:04:49,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:04:49,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:04:49,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 19:04:49,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:04:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:50,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:04:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:04:51,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:04:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910704262] [2024-10-14 19:04:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910704262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:04:51,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:04:51,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:04:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758770114] [2024-10-14 19:04:51,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:04:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:04:51,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:04:51,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:04:51,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:04:51,607 INFO L87 Difference]: Start difference. First operand 902 states and 1019 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-10-14 19:04:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:04:59,977 INFO L93 Difference]: Finished difference Result 939 states and 1087 transitions. [2024-10-14 19:04:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:04:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2024-10-14 19:04:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:04:59,981 INFO L225 Difference]: With dead ends: 939 [2024-10-14 19:04:59,981 INFO L226 Difference]: Without dead ends: 936 [2024-10-14 19:04:59,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:04:59,984 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 25 mSDsluCounter, 16048 mSDsCounter, 0 mSdLazyCounter, 4094 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16747 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:04:59,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16747 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4094 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 19:04:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-14 19:04:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2024-10-14 19:04:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 585 states have (on average 1.7658119658119658) internal successors, (1033), 928 states have internal predecessors, (1033), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:04:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1062 transitions. [2024-10-14 19:04:59,994 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1062 transitions. Word has length 86 [2024-10-14 19:04:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:04:59,994 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1062 transitions. [2024-10-14 19:04:59,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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-10-14 19:04:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1062 transitions. [2024-10-14 19:04:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 19:04:59,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:04:59,995 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] [2024-10-14 19:05:00,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-14 19:05:00,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:00,196 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-14 19:05:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -499419721, now seen corresponding path program 5 times [2024-10-14 19:05:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:00,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304337458] [2024-10-14 19:05:00,197 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:05:00,197 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-10-14 19:05:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:00,198 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:00,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 19:05:01,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:05:01,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:05:01,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 19:05:01,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:01,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:05:01,354 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:05:01,355 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-10-14 19:05:01,376 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-10-14 19:05:01,441 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-10-14 19:05:02,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:05:02,264 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-10-14 19:05:02,298 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-10-14 19:05:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:05:02,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:05:02,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304337458] [2024-10-14 19:05:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304337458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:05:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [674954840] [2024-10-14 19:05:02,638 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:05:02,638 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:05:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:05:02,639 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:05:02,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-10-14 19:05:03,147 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:05:03,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:05:03,190 WARN L253 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 619 conjuncts are in the unsatisfiable core [2024-10-14 19:05:03,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:03,231 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-10-14 19:05:03,235 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 8 treesize of output 1 [2024-10-14 19:05:03,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:05:03,332 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:05:03,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:05:03,364 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-10-14 19:05:03,541 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:05:03,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:05:03,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:03,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:05:03,987 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 8 treesize of output 1 [2024-10-14 19:05:03,992 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 8 treesize of output 1 [2024-10-14 19:05:20,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989 [2024-10-14 19:05:20,778 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 8 treesize of output 1