./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_SAX_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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_SAX_test10-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 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:59:37,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:59:37,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:59:37,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:59:37,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:59:37,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:59:37,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:59:37,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:59:37,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:59:37,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:59:37,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:59:37,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:59:37,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:59:37,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:59:37,603 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:59:37,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:59:37,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:59:37,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:59:37,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:59:37,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:59:37,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:59:37,609 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:59:37,609 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:59:37,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:59:37,610 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:59:37,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:59:37,610 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:59:37,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:59:37,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:59:37,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:59:37,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:59:37,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:59:37,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:59:37,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:59:37,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:59:37,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:59:37,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:59:37,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:59:37,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:59:37,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:59:37,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:59:37,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:59:37,617 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 -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2024-10-13 11:59:37,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:59:37,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:59:37,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:59:37,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:59:37,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:59:37,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-13 11:59:39,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:59:39,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:59:39,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-13 11:59:39,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fbf44dce/af07f7bd56444140ab9b78e53fa9421e/FLAGecb852799 [2024-10-13 11:59:39,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fbf44dce/af07f7bd56444140ab9b78e53fa9421e [2024-10-13 11:59:39,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:59:39,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:59:39,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:39,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:59:39,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:59:39,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:39" (1/1) ... [2024-10-13 11:59:39,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4542d3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:39, skipping insertion in model container [2024-10-13 11:59:39,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:39" (1/1) ... [2024-10-13 11:59:39,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:59:40,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:40,587 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-13 11:59:40,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1238445d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:40, skipping insertion in model container [2024-10-13 11:59:40,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:40,588 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:59:40,590 INFO L158 Benchmark]: Toolchain (without parser) took 707.91ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 101.3MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 11:59:40,591 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:59:40,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.90ms. Allocated memory is still 163.6MB. Free memory was 132.8MB in the beginning and 101.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 11:59:40,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.90ms. Allocated memory is still 163.6MB. Free memory was 132.8MB in the beginning and 101.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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_SAX_test10-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 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:59:42,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:59:42,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:59:42,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:59:42,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:59:42,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:59:42,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:59:42,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:59:42,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:59:42,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:59:42,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:59:42,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:59:42,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:59:42,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:59:42,763 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:59:42,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:59:42,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:59:42,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:59:42,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:59:42,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:59:42,768 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:59:42,772 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:59:42,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:59:42,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:59:42,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:59:42,772 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:59:42,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:59:42,773 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:59:42,773 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:59:42,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:59:42,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:59:42,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:59:42,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:59:42,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:59:42,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:59:42,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:59:42,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:59:42,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:59:42,775 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:59:42,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:59:42,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:59:42,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:59:42,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:59:42,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:59:42,778 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:59:42,779 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 -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2024-10-13 11:59:43,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:59:43,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:59:43,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:59:43,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:59:43,161 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:59:43,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-13 11:59:44,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:59:45,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:59:45,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2024-10-13 11:59:45,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92244c5d2/87f46775534c4ba1b0ce72584db8eebf/FLAG3dc41bca1 [2024-10-13 11:59:45,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92244c5d2/87f46775534c4ba1b0ce72584db8eebf [2024-10-13 11:59:45,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:59:45,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:59:45,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:45,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:59:45,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:59:45,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:45" (1/1) ... [2024-10-13 11:59:45,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13647c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:45, skipping insertion in model container [2024-10-13 11:59:45,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:59:45" (1/1) ... [2024-10-13 11:59:45,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:59:46,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:46,064 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:59:46,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:59:46,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:46,215 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:59:46,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:59:46,380 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:59:46,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46 WrapperNode [2024-10-13 11:59:46,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:59:46,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:59:46,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:59:46,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:59:46,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,542 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2439 [2024-10-13 11:59:46,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:59:46,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:59:46,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:59:46,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:59:46,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,769 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 106, 420]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 4, 90]. [2024-10-13 11:59:46,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:59:46,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:59:46,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:59:46,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:59:46,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (1/1) ... [2024-10-13 11:59:46,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:59:46,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:59:46,957 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-13 11:59:46,960 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-13 11:59:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:59:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:59:47,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:59:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-13 11:59:47,007 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-13 11:59:47,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:59:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:59:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:59:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:59:47,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:59:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:59:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:59:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:59:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:59:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:59:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:59:47,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:59:47,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:59:47,284 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:59:47,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:59:47,347 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:59:47,375 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:59:47,423 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:59:54,515 INFO L? ?]: Removed 2232 outVars from TransFormulas that were not future-live. [2024-10-13 11:59:54,515 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:59:54,802 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:59:54,802 INFO L314 CfgBuilder]: Removed 160 assume(true) statements. [2024-10-13 11:59:54,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:59:54 BoogieIcfgContainer [2024-10-13 11:59:54,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:59:54,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:59:54,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:59:54,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:59:54,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:59:45" (1/3) ... [2024-10-13 11:59:54,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602a8612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:59:54, skipping insertion in model container [2024-10-13 11:59:54,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:59:46" (2/3) ... [2024-10-13 11:59:54,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602a8612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:59:54, skipping insertion in model container [2024-10-13 11:59:54,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:59:54" (3/3) ... [2024-10-13 11:59:54,811 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-2.i [2024-10-13 11:59:54,831 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:59:54,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1091 error locations. [2024-10-13 11:59:54,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:59:54,926 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;@2094cb82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:59:54,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2024-10-13 11:59:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 2060 states, 957 states have (on average 2.456635318704284) internal successors, (2351), 2046 states have internal predecessors, (2351), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 11:59:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:59:54,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:54,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:59:54,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 11:59:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 119657, now seen corresponding path program 1 times [2024-10-13 11:59:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354071622] [2024-10-13 11:59:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:54,963 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-13 11:59:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:54,967 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-13 11:59:54,969 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-13 11:59:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:55,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:59:55,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:55,271 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-13 11:59:55,284 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-13 11:59:55,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:55,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354071622] [2024-10-13 11:59:55,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354071622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:55,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:59:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896225500] [2024-10-13 11:59:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:55,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:55,331 INFO L87 Difference]: Start difference. First operand has 2060 states, 957 states have (on average 2.456635318704284) internal successors, (2351), 2046 states have internal predecessors, (2351), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-13 11:59:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:59:58,560 INFO L93 Difference]: Finished difference Result 2659 states and 2843 transitions. [2024-10-13 11:59:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:59:58,563 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-13 11:59:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:59:58,592 INFO L225 Difference]: With dead ends: 2659 [2024-10-13 11:59:58,593 INFO L226 Difference]: Without dead ends: 2658 [2024-10-13 11:59:58,594 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-13 11:59:58,597 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 1946 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1956 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:59:58,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1956 Valid, 1561 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 11:59:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-10-13 11:59:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2169. [2024-10-13 11:59:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1094 states have (on average 2.257769652650823) internal successors, (2470), 2153 states have internal predecessors, (2470), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:59:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2502 transitions. [2024-10-13 11:59:58,746 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2502 transitions. Word has length 2 [2024-10-13 11:59:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:59:58,747 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 2502 transitions. [2024-10-13 11:59:58,747 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-13 11:59:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2502 transitions. [2024-10-13 11:59:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:59:58,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:59:58,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:59:58,755 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-13 11:59:58,952 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-13 11:59:58,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 11:59:58,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:59:58,953 INFO L85 PathProgramCache]: Analyzing trace with hash 119658, now seen corresponding path program 1 times [2024-10-13 11:59:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:59:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892339790] [2024-10-13 11:59:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:59:58,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-13 11:59:58,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:59:58,955 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-13 11:59:58,956 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-13 11:59:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:59:59,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:59:59,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:59:59,134 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-13 11:59:59,148 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-13 11:59:59,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:59:59,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:59:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892339790] [2024-10-13 11:59:59,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892339790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:59:59,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:59:59,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:59:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174903226] [2024-10-13 11:59:59,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:59:59,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:59:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:59:59,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:59:59,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:59:59,153 INFO L87 Difference]: Start difference. First operand 2169 states and 2502 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-13 12:00:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:03,438 INFO L93 Difference]: Finished difference Result 2894 states and 3307 transitions. [2024-10-13 12:00:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:03,439 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-13 12:00:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:03,449 INFO L225 Difference]: With dead ends: 2894 [2024-10-13 12:00:03,449 INFO L226 Difference]: Without dead ends: 2894 [2024-10-13 12:00:03,450 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-13 12:00:03,452 INFO L432 NwaCegarLoop]: 1683 mSDtfsCounter, 799 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:03,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2777 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 12:00:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2024-10-13 12:00:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2566. [2024-10-13 12:00:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1489 states have (on average 2.19543317662861) internal successors, (3269), 2547 states have internal predecessors, (3269), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 12:00:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3307 transitions. [2024-10-13 12:00:03,518 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3307 transitions. Word has length 2 [2024-10-13 12:00:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:03,518 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3307 transitions. [2024-10-13 12:00:03,518 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-13 12:00:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3307 transitions. [2024-10-13 12:00:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:00:03,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:03,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:00:03,523 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-13 12:00:03,722 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-13 12:00:03,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1162343629, now seen corresponding path program 1 times [2024-10-13 12:00:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721846924] [2024-10-13 12:00:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:03,724 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-13 12:00:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:03,727 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-13 12:00:03,728 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-13 12:00:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:03,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:00:03,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:03,960 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-13 12:00:03,966 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-13 12:00:04,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:00:04,025 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-13 12:00:04,047 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:00:04,047 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-13 12:00:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:00:04,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:04,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721846924] [2024-10-13 12:00:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721846924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:00:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133891933] [2024-10-13 12:00:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:04,078 INFO L87 Difference]: Start difference. First operand 2566 states and 3307 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-13 12:00:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:10,913 INFO L93 Difference]: Finished difference Result 4608 states and 5499 transitions. [2024-10-13 12:00:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:10,914 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-13 12:00:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:10,932 INFO L225 Difference]: With dead ends: 4608 [2024-10-13 12:00:10,932 INFO L226 Difference]: Without dead ends: 4608 [2024-10-13 12:00:10,933 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-13 12:00:10,936 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 3927 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:10,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1933 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-13 12:00:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-10-13 12:00:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3140. [2024-10-13 12:00:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3140 states, 2063 states have (on average 2.243819680077557) internal successors, (4629), 3115 states have internal predecessors, (4629), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4679 transitions. [2024-10-13 12:00:11,028 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4679 transitions. Word has length 6 [2024-10-13 12:00:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 3140 states and 4679 transitions. [2024-10-13 12:00:11,029 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-13 12:00:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4679 transitions. [2024-10-13 12:00:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:00:11,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:11,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:11,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:11,233 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-13 12:00:11,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914111, now seen corresponding path program 1 times [2024-10-13 12:00:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172504470] [2024-10-13 12:00:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:11,235 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-13 12:00:11,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:11,242 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-13 12:00:11,243 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-13 12:00:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:11,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:11,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:11,442 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-13 12:00:11,455 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-13 12:00:11,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:11,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:11,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172504470] [2024-10-13 12:00:11,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172504470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:11,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:11,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:00:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096725427] [2024-10-13 12:00:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:11,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:00:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:11,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:00:11,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:00:11,460 INFO L87 Difference]: Start difference. First operand 3140 states and 4679 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-13 12:00:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:14,113 INFO L93 Difference]: Finished difference Result 3776 states and 5273 transitions. [2024-10-13 12:00:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:14,114 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-13 12:00:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:14,128 INFO L225 Difference]: With dead ends: 3776 [2024-10-13 12:00:14,129 INFO L226 Difference]: Without dead ends: 3776 [2024-10-13 12:00:14,129 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-13 12:00:14,130 INFO L432 NwaCegarLoop]: 1839 mSDtfsCounter, 1726 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:14,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2417 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 12:00:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-10-13 12:00:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3048. [2024-10-13 12:00:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2063 states have (on average 2.1396025206010663) internal successors, (4414), 3023 states have internal predecessors, (4414), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4464 transitions. [2024-10-13 12:00:14,204 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4464 transitions. Word has length 7 [2024-10-13 12:00:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:14,205 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4464 transitions. [2024-10-13 12:00:14,205 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-13 12:00:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4464 transitions. [2024-10-13 12:00:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:00:14,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:14,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:14,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:00:14,410 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-13 12:00:14,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:14,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1672914110, now seen corresponding path program 1 times [2024-10-13 12:00:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:14,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993322029] [2024-10-13 12:00:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:14,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:14,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:14,416 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-13 12:00:14,417 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-13 12:00:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:14,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:00:14,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:14,608 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-13 12:00:14,642 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-13 12:00:14,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:14,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993322029] [2024-10-13 12:00:14,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993322029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:00:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532379535] [2024-10-13 12:00:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:14,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:00:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:00:14,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:00:14,648 INFO L87 Difference]: Start difference. First operand 3048 states and 4464 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-13 12:00:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:18,777 INFO L93 Difference]: Finished difference Result 4617 states and 6688 transitions. [2024-10-13 12:00:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:18,778 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-13 12:00:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:18,795 INFO L225 Difference]: With dead ends: 4617 [2024-10-13 12:00:18,795 INFO L226 Difference]: Without dead ends: 4617 [2024-10-13 12:00:18,796 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-13 12:00:18,796 INFO L432 NwaCegarLoop]: 2133 mSDtfsCounter, 1285 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:18,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3048 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 12:00:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2024-10-13 12:00:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 3316. [2024-10-13 12:00:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2341 states have (on average 2.126441691584793) internal successors, (4978), 3291 states have internal predecessors, (4978), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 5028 transitions. [2024-10-13 12:00:18,887 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 5028 transitions. Word has length 7 [2024-10-13 12:00:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:18,887 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 5028 transitions. [2024-10-13 12:00:18,887 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-13 12:00:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 5028 transitions. [2024-10-13 12:00:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:00:18,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:18,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:18,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:19,092 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-13 12:00:19,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -286775368, now seen corresponding path program 1 times [2024-10-13 12:00:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768326290] [2024-10-13 12:00:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:19,094 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-13 12:00:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:19,096 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-13 12:00:19,097 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-13 12:00:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:19,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:00:19,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:19,271 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-13 12:00:19,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:19,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768326290] [2024-10-13 12:00:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768326290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:19,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:19,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:19,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888574942] [2024-10-13 12:00:19,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:19,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:00:19,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:00:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:00:19,276 INFO L87 Difference]: Start difference. First operand 3316 states and 5028 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-13 12:00:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:20,289 INFO L93 Difference]: Finished difference Result 3262 states and 4948 transitions. [2024-10-13 12:00:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-13 12:00:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:20,300 INFO L225 Difference]: With dead ends: 3262 [2024-10-13 12:00:20,300 INFO L226 Difference]: Without dead ends: 3262 [2024-10-13 12:00:20,300 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-13 12:00:20,301 INFO L432 NwaCegarLoop]: 1805 mSDtfsCounter, 61 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:20,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3568 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:00:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-13 12:00:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2024-10-13 12:00:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 2311 states have (on average 2.119428818693206) internal successors, (4898), 3237 states have internal predecessors, (4898), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4948 transitions. [2024-10-13 12:00:20,380 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4948 transitions. Word has length 10 [2024-10-13 12:00:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:20,381 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4948 transitions. [2024-10-13 12:00:20,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-13 12:00:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4948 transitions. [2024-10-13 12:00:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 12:00:20,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:20,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:20,386 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-13 12:00:20,582 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-13 12:00:20,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:20,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash -713168110, now seen corresponding path program 1 times [2024-10-13 12:00:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:20,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99189890] [2024-10-13 12:00:20,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:20,585 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-13 12:00:20,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:20,588 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-13 12:00:20,590 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-13 12:00:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:20,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:20,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:20,794 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-13 12:00:20,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:20,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99189890] [2024-10-13 12:00:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99189890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:20,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55801025] [2024-10-13 12:00:20,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:20,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:20,796 INFO L87 Difference]: Start difference. First operand 3262 states and 4948 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 12:00:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:22,143 INFO L93 Difference]: Finished difference Result 3246 states and 4904 transitions. [2024-10-13 12:00:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:00:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 12:00:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:22,155 INFO L225 Difference]: With dead ends: 3246 [2024-10-13 12:00:22,155 INFO L226 Difference]: Without dead ends: 3246 [2024-10-13 12:00:22,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-13 12:00:22,156 INFO L432 NwaCegarLoop]: 1774 mSDtfsCounter, 45 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5304 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:22,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5304 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 12:00:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2024-10-13 12:00:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3246. [2024-10-13 12:00:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 2309 states have (on average 2.1022087483759204) internal successors, (4854), 3221 states have internal predecessors, (4854), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 4904 transitions. [2024-10-13 12:00:22,218 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 4904 transitions. Word has length 12 [2024-10-13 12:00:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 4904 transitions. [2024-10-13 12:00:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 12:00:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 4904 transitions. [2024-10-13 12:00:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 12:00:22,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:22,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:22,225 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-13 12:00:22,424 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-13 12:00:22,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:22,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1884128953, now seen corresponding path program 1 times [2024-10-13 12:00:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:22,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837550611] [2024-10-13 12:00:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:22,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:22,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:22,430 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-13 12:00:22,431 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-13 12:00:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:22,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:00:22,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:22,681 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-13 12:00:22,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:22,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837550611] [2024-10-13 12:00:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837550611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058789860] [2024-10-13 12:00:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:00:22,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:22,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:00:22,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:00:22,684 INFO L87 Difference]: Start difference. First operand 3246 states and 4904 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 12:00:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:23,673 INFO L93 Difference]: Finished difference Result 3132 states and 4664 transitions. [2024-10-13 12:00:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:23,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 12:00:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:23,685 INFO L225 Difference]: With dead ends: 3132 [2024-10-13 12:00:23,685 INFO L226 Difference]: Without dead ends: 3132 [2024-10-13 12:00:23,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-13 12:00:23,686 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 61 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:23,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3452 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:00:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2024-10-13 12:00:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3132. [2024-10-13 12:00:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2219 states have (on average 2.079315006759802) internal successors, (4614), 3107 states have internal predecessors, (4614), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4664 transitions. [2024-10-13 12:00:23,741 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4664 transitions. Word has length 17 [2024-10-13 12:00:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:23,741 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4664 transitions. [2024-10-13 12:00:23,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 12:00:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4664 transitions. [2024-10-13 12:00:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 12:00:23,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:23,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:23,750 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-13 12:00:23,947 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-13 12:00:23,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:23,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2141973639, now seen corresponding path program 1 times [2024-10-13 12:00:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:23,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749979135] [2024-10-13 12:00:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:23,949 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-13 12:00:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:23,952 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-13 12:00:23,953 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-13 12:00:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:24,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:00:24,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:24,186 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-13 12:00:24,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:24,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749979135] [2024-10-13 12:00:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749979135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:24,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:24,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251410054] [2024-10-13 12:00:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:00:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:00:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:00:24,188 INFO L87 Difference]: Start difference. First operand 3132 states and 4664 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 12:00:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:25,144 INFO L93 Difference]: Finished difference Result 3078 states and 4584 transitions. [2024-10-13 12:00:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:25,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 12:00:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:25,154 INFO L225 Difference]: With dead ends: 3078 [2024-10-13 12:00:25,157 INFO L226 Difference]: Without dead ends: 3078 [2024-10-13 12:00:25,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-13 12:00:25,158 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 61 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:25,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3378 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:00:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2024-10-13 12:00:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3078. [2024-10-13 12:00:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2189 states have (on average 2.0712654179990864) internal successors, (4534), 3053 states have internal predecessors, (4534), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4584 transitions. [2024-10-13 12:00:25,224 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4584 transitions. Word has length 17 [2024-10-13 12:00:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:25,224 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4584 transitions. [2024-10-13 12:00:25,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 12:00:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4584 transitions. [2024-10-13 12:00:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:00:25,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:25,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:25,233 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-13 12:00:25,427 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-13 12:00:25,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1828249453, now seen corresponding path program 1 times [2024-10-13 12:00:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097957881] [2024-10-13 12:00:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:25,429 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-13 12:00:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:25,432 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-13 12:00:25,433 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-13 12:00:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:25,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:25,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:25,634 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-13 12:00:25,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:25,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097957881] [2024-10-13 12:00:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097957881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:25,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108620489] [2024-10-13 12:00:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:25,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:25,636 INFO L87 Difference]: Start difference. First operand 3078 states and 4584 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 12:00:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:26,711 INFO L93 Difference]: Finished difference Result 3058 states and 4452 transitions. [2024-10-13 12:00:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:00:26,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-13 12:00:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:26,719 INFO L225 Difference]: With dead ends: 3058 [2024-10-13 12:00:26,719 INFO L226 Difference]: Without dead ends: 3058 [2024-10-13 12:00:26,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-13 12:00:26,720 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 45 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:26,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5019 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:00:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-10-13 12:00:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2024-10-13 12:00:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 2183 states have (on average 2.016491067338525) internal successors, (4402), 3033 states have internal predecessors, (4402), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 4452 transitions. [2024-10-13 12:00:26,759 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 4452 transitions. Word has length 19 [2024-10-13 12:00:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:26,760 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 4452 transitions. [2024-10-13 12:00:26,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 12:00:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 4452 transitions. [2024-10-13 12:00:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:00:26,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:26,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:00:26,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:00:26,962 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-13 12:00:26,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1147334253, now seen corresponding path program 1 times [2024-10-13 12:00:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:26,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471084882] [2024-10-13 12:00:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:26,964 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-13 12:00:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:26,965 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-13 12:00:26,966 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-13 12:00:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:27,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:27,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:27,180 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-13 12:00:27,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:27,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471084882] [2024-10-13 12:00:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471084882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:27,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611888875] [2024-10-13 12:00:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:27,184 INFO L87 Difference]: Start difference. First operand 3058 states and 4452 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 12:00:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:28,298 INFO L93 Difference]: Finished difference Result 3042 states and 4408 transitions. [2024-10-13 12:00:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:00:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-13 12:00:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:28,304 INFO L225 Difference]: With dead ends: 3042 [2024-10-13 12:00:28,304 INFO L226 Difference]: Without dead ends: 3042 [2024-10-13 12:00:28,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-13 12:00:28,305 INFO L432 NwaCegarLoop]: 1658 mSDtfsCounter, 45 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:28,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4956 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:00:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2024-10-13 12:00:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3042. [2024-10-13 12:00:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2181 states have (on average 1.9981659789087574) internal successors, (4358), 3017 states have internal predecessors, (4358), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4408 transitions. [2024-10-13 12:00:28,348 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4408 transitions. Word has length 19 [2024-10-13 12:00:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:28,348 INFO L471 AbstractCegarLoop]: Abstraction has 3042 states and 4408 transitions. [2024-10-13 12:00:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 12:00:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4408 transitions. [2024-10-13 12:00:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:00:28,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:28,350 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] [2024-10-13 12:00:28,356 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-13 12:00:28,550 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-13 12:00:28,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:28,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash 303308928, now seen corresponding path program 1 times [2024-10-13 12:00:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:28,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697370379] [2024-10-13 12:00:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:28,552 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-13 12:00:28,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:28,553 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-13 12:00:28,554 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-13 12:00:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:28,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:00:28,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:28,725 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-13 12:00:28,790 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-13 12:00:28,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:28,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697370379] [2024-10-13 12:00:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697370379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:00:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793289988] [2024-10-13 12:00:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:28,792 INFO L87 Difference]: Start difference. First operand 3042 states and 4408 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 12:00:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:31,501 INFO L93 Difference]: Finished difference Result 3460 states and 4733 transitions. [2024-10-13 12:00:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-13 12:00:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:31,508 INFO L225 Difference]: With dead ends: 3460 [2024-10-13 12:00:31,508 INFO L226 Difference]: Without dead ends: 3460 [2024-10-13 12:00:31,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-13 12:00:31,509 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1666 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:31,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2354 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 12:00:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-10-13 12:00:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3038. [2024-10-13 12:00:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 2181 states have (on average 1.9944979367262723) internal successors, (4350), 3013 states have internal predecessors, (4350), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 4400 transitions. [2024-10-13 12:00:31,549 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 4400 transitions. Word has length 26 [2024-10-13 12:00:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:31,549 INFO L471 AbstractCegarLoop]: Abstraction has 3038 states and 4400 transitions. [2024-10-13 12:00:31,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 12:00:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 4400 transitions. [2024-10-13 12:00:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:00:31,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:31,551 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] [2024-10-13 12:00:31,556 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-13 12:00:31,753 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-13 12:00:31,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 303308929, now seen corresponding path program 1 times [2024-10-13 12:00:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823940143] [2024-10-13 12:00:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:31,756 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-13 12:00:31,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:31,759 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-13 12:00:31,761 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-13 12:00:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:31,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:00:31,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:31,971 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-13 12:00:32,111 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-13 12:00:32,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:32,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823940143] [2024-10-13 12:00:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823940143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:00:32,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388569124] [2024-10-13 12:00:32,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:32,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:32,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:32,113 INFO L87 Difference]: Start difference. First operand 3038 states and 4400 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 12:00:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:36,012 INFO L93 Difference]: Finished difference Result 3706 states and 5140 transitions. [2024-10-13 12:00:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-13 12:00:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:36,018 INFO L225 Difference]: With dead ends: 3706 [2024-10-13 12:00:36,018 INFO L226 Difference]: Without dead ends: 3706 [2024-10-13 12:00:36,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-13 12:00:36,019 INFO L432 NwaCegarLoop]: 1435 mSDtfsCounter, 737 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:36,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3249 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 12:00:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2024-10-13 12:00:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3071. [2024-10-13 12:00:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2214 states have (on average 1.98193315266486) internal successors, (4388), 3046 states have internal predecessors, (4388), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4438 transitions. [2024-10-13 12:00:36,061 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4438 transitions. Word has length 26 [2024-10-13 12:00:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4438 transitions. [2024-10-13 12:00:36,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 12:00:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4438 transitions. [2024-10-13 12:00:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:00:36,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:36,063 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] [2024-10-13 12:00:36,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:36,263 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-13 12:00:36,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:36,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash 575845249, now seen corresponding path program 1 times [2024-10-13 12:00:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313942241] [2024-10-13 12:00:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:36,265 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-13 12:00:36,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:36,268 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-13 12:00:36,270 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-13 12:00:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:36,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:00:36,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:36,497 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-13 12:00:36,544 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-13 12:00:36,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:36,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313942241] [2024-10-13 12:00:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313942241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881021282] [2024-10-13 12:00:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:36,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:36,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:36,546 INFO L87 Difference]: Start difference. First operand 3071 states and 4438 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:39,615 INFO L93 Difference]: Finished difference Result 3724 states and 5139 transitions. [2024-10-13 12:00:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:00:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:39,619 INFO L225 Difference]: With dead ends: 3724 [2024-10-13 12:00:39,619 INFO L226 Difference]: Without dead ends: 3724 [2024-10-13 12:00:39,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 12:00:39,620 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1526 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:39,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3531 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 12:00:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-10-13 12:00:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3067. [2024-10-13 12:00:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2214 states have (on average 1.971093044263776) internal successors, (4364), 3042 states have internal predecessors, (4364), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:39,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4414 transitions. [2024-10-13 12:00:39,659 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4414 transitions. Word has length 33 [2024-10-13 12:00:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:39,659 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4414 transitions. [2024-10-13 12:00:39,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4414 transitions. [2024-10-13 12:00:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:00:39,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:39,661 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] [2024-10-13 12:00:39,667 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 (15)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:39,861 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-13 12:00:39,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 575845250, now seen corresponding path program 1 times [2024-10-13 12:00:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088858987] [2024-10-13 12:00:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:39,862 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-13 12:00:39,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:39,866 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-13 12:00:39,867 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-13 12:00:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:40,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:00:40,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:40,099 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-13 12:00:40,255 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-13 12:00:40,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:40,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:40,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088858987] [2024-10-13 12:00:40,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088858987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:40,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:40,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:40,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191617619] [2024-10-13 12:00:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:40,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:40,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:40,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:40,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:40,257 INFO L87 Difference]: Start difference. First operand 3067 states and 4414 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:44,712 INFO L93 Difference]: Finished difference Result 4256 states and 5942 transitions. [2024-10-13 12:00:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:00:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:44,717 INFO L225 Difference]: With dead ends: 4256 [2024-10-13 12:00:44,718 INFO L226 Difference]: Without dead ends: 4256 [2024-10-13 12:00:44,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 12:00:44,718 INFO L432 NwaCegarLoop]: 1975 mSDtfsCounter, 1081 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:44,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 4162 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 12:00:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2024-10-13 12:00:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 3067. [2024-10-13 12:00:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2214 states have (on average 1.967479674796748) internal successors, (4356), 3042 states have internal predecessors, (4356), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4406 transitions. [2024-10-13 12:00:44,759 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4406 transitions. Word has length 33 [2024-10-13 12:00:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4406 transitions. [2024-10-13 12:00:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4406 transitions. [2024-10-13 12:00:44,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:00:44,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:44,760 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] [2024-10-13 12:00:44,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-13 12:00:44,960 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-13 12:00:44,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:44,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash 601006657, now seen corresponding path program 1 times [2024-10-13 12:00:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210776570] [2024-10-13 12:00:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:44,963 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-13 12:00:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:44,967 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-13 12:00:44,968 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-13 12:00:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:45,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:00:45,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:45,202 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-13 12:00:45,269 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-13 12:00:45,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:45,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:45,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210776570] [2024-10-13 12:00:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210776570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:45,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844735688] [2024-10-13 12:00:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:45,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:45,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:45,271 INFO L87 Difference]: Start difference. First operand 3067 states and 4406 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:48,471 INFO L93 Difference]: Finished difference Result 3704 states and 5107 transitions. [2024-10-13 12:00:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:00:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:48,479 INFO L225 Difference]: With dead ends: 3704 [2024-10-13 12:00:48,479 INFO L226 Difference]: Without dead ends: 3704 [2024-10-13 12:00:48,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 12:00:48,480 INFO L432 NwaCegarLoop]: 1679 mSDtfsCounter, 1522 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:48,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3531 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 12:00:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2024-10-13 12:00:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3063. [2024-10-13 12:00:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2214 states have (on average 1.96386630532972) internal successors, (4348), 3038 states have internal predecessors, (4348), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4398 transitions. [2024-10-13 12:00:48,523 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4398 transitions. Word has length 33 [2024-10-13 12:00:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:48,524 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4398 transitions. [2024-10-13 12:00:48,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4398 transitions. [2024-10-13 12:00:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:00:48,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:48,526 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] [2024-10-13 12:00:48,533 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-13 12:00:48,726 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-13 12:00:48,727 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:48,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 601006658, now seen corresponding path program 1 times [2024-10-13 12:00:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:48,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409415628] [2024-10-13 12:00:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:48,728 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-13 12:00:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:48,732 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-13 12:00:48,733 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-13 12:00:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:48,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:00:48,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:48,989 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-13 12:00:49,159 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-13 12:00:49,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:49,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:49,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409415628] [2024-10-13 12:00:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409415628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:49,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:00:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960993780] [2024-10-13 12:00:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:49,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:49,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:49,163 INFO L87 Difference]: Start difference. First operand 3063 states and 4398 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:53,743 INFO L93 Difference]: Finished difference Result 4248 states and 5926 transitions. [2024-10-13 12:00:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:00:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:00:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:53,748 INFO L225 Difference]: With dead ends: 4248 [2024-10-13 12:00:53,748 INFO L226 Difference]: Without dead ends: 4248 [2024-10-13 12:00:53,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 12:00:53,749 INFO L432 NwaCegarLoop]: 1971 mSDtfsCounter, 1073 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 2784 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:53,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 4127 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2784 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 12:00:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2024-10-13 12:00:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 3059. [2024-10-13 12:00:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 2214 states have (on average 1.960252935862692) internal successors, (4340), 3034 states have internal predecessors, (4340), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 4390 transitions. [2024-10-13 12:00:53,790 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 4390 transitions. Word has length 33 [2024-10-13 12:00:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:53,790 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 4390 transitions. [2024-10-13 12:00:53,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 12:00:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 4390 transitions. [2024-10-13 12:00:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 12:00:53,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:53,791 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] [2024-10-13 12:00:53,798 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-13 12:00:53,995 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-13 12:00:53,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1877036666, now seen corresponding path program 1 times [2024-10-13 12:00:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153225053] [2024-10-13 12:00:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:53,998 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-13 12:00:53,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:54,003 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-13 12:00:54,004 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-13 12:00:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:54,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:54,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:54,266 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-13 12:00:54,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:54,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153225053] [2024-10-13 12:00:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153225053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:54,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721715737] [2024-10-13 12:00:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:54,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:54,272 INFO L87 Difference]: Start difference. First operand 3059 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 12:00:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:55,852 INFO L93 Difference]: Finished difference Result 3047 states and 4366 transitions. [2024-10-13 12:00:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:00:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-13 12:00:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:55,858 INFO L225 Difference]: With dead ends: 3047 [2024-10-13 12:00:55,858 INFO L226 Difference]: Without dead ends: 3047 [2024-10-13 12:00:55,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-13 12:00:55,859 INFO L432 NwaCegarLoop]: 1644 mSDtfsCounter, 21 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:55,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4909 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 12:00:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2024-10-13 12:00:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 3047. [2024-10-13 12:00:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 2202 states have (on average 1.9600363306085378) internal successors, (4316), 3022 states have internal predecessors, (4316), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:00:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 4366 transitions. [2024-10-13 12:00:55,897 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 4366 transitions. Word has length 40 [2024-10-13 12:00:55,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:55,897 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 4366 transitions. [2024-10-13 12:00:55,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 12:00:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4366 transitions. [2024-10-13 12:00:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 12:00:55,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:55,898 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] [2024-10-13 12:00:55,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 12:00:56,102 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-13 12:00:56,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:56,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1228682057, now seen corresponding path program 1 times [2024-10-13 12:00:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741473424] [2024-10-13 12:00:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:00:56,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:56,108 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-13 12:00:56,109 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-13 12:00:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:56,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:56,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:56,506 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-13 12:00:56,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:56,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741473424] [2024-10-13 12:00:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741473424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:56,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:56,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:00:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963951927] [2024-10-13 12:00:56,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:56,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:00:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:00:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:00:56,509 INFO L87 Difference]: Start difference. First operand 3047 states and 4366 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-13 12:00:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:57,952 INFO L93 Difference]: Finished difference Result 4508 states and 6234 transitions. [2024-10-13 12:00:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:00:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-10-13 12:00:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:57,958 INFO L225 Difference]: With dead ends: 4508 [2024-10-13 12:00:57,958 INFO L226 Difference]: Without dead ends: 4508 [2024-10-13 12:00:57,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-13 12:00:57,959 INFO L432 NwaCegarLoop]: 1712 mSDtfsCounter, 1175 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:57,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 3274 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 12:00:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2024-10-13 12:00:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 3928. [2024-10-13 12:00:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3076 states have (on average 1.944408322496749) internal successors, (5981), 3893 states have internal predecessors, (5981), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 12:00:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 6051 transitions. [2024-10-13 12:00:58,014 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 6051 transitions. Word has length 44 [2024-10-13 12:00:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:58,014 INFO L471 AbstractCegarLoop]: Abstraction has 3928 states and 6051 transitions. [2024-10-13 12:00:58,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-13 12:00:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 6051 transitions. [2024-10-13 12:00:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 12:00:58,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:58,017 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] [2024-10-13 12:00:58,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 12:00:58,217 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-13 12:00:58,218 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2024-10-13 12:00:58,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:00:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1257793787, now seen corresponding path program 1 times [2024-10-13 12:00:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:00:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280121244] [2024-10-13 12:00:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:00:58,220 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-13 12:00:58,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:00:58,223 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-13 12:00:58,225 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-13 12:00:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:00:58,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:00:58,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:00:58,568 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-13 12:00:58,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:00:58,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:00:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280121244] [2024-10-13 12:00:58,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280121244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:00:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:00:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:00:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480049038] [2024-10-13 12:00:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:00:58,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:00:58,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:00:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:00:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:00:58,572 INFO L87 Difference]: Start difference. First operand 3928 states and 6051 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-13 12:00:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:00:59,859 INFO L93 Difference]: Finished difference Result 3886 states and 5981 transitions. [2024-10-13 12:00:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:00:59,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-10-13 12:00:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:00:59,866 INFO L225 Difference]: With dead ends: 3886 [2024-10-13 12:00:59,866 INFO L226 Difference]: Without dead ends: 3886 [2024-10-13 12:00:59,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-13 12:00:59,867 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 21 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:00:59,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4897 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 12:00:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-10-13 12:00:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2024-10-13 12:00:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3034 states have (on average 1.9482531311799605) internal successors, (5911), 3851 states have internal predecessors, (5911), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 12:00:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5981 transitions. [2024-10-13 12:00:59,909 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5981 transitions. Word has length 49 [2024-10-13 12:00:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:00:59,909 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 5981 transitions. [2024-10-13 12:00:59,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-13 12:00:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5981 transitions. [2024-10-13 12:00:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 12:00:59,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:00:59,910 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] [2024-10-13 12:00:59,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0