./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_BER_nondet_test4-1.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_BER_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:44:28,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:44:28,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:44:28,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:44:28,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:44:28,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:44:28,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:44:28,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:44:28,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:44:28,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:44:28,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:44:28,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:44:28,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:44:28,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:44:28,570 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:44:28,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:44:28,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:44:28,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:44:28,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:44:28,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:44:28,571 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:44:28,575 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:44:28,575 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:44:28,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:44:28,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:44:28,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:44:28,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:44:28,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:44:28,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:44:28,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:44:28,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:44:28,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:44:28,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:44:28,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:44:28,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:44:28,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:44:28,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:44:28,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:44:28,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:44:28,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:44:28,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:44:28,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:44:28,582 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-13 11:44:28,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:44:28,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:44:28,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:44:28,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:44:28,811 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:44:28,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 11:44:30,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:44:30,272 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:44:30,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 11:44:30,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9232065fc/11709357d41f4ee8bd94e3853944e8f0/FLAG6e248da80 [2024-10-13 11:44:30,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9232065fc/11709357d41f4ee8bd94e3853944e8f0 [2024-10-13 11:44:30,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:44:30,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:44:30,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:30,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:44:30,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:44:30,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:30" (1/1) ... [2024-10-13 11:44:30,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40835311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:30, skipping insertion in model container [2024-10-13 11:44:30,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:30" (1/1) ... [2024-10-13 11:44:30,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:44:30,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:30,807 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:44:30,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bf1e234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:30, skipping insertion in model container [2024-10-13 11:44:30,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:30,809 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:44:30,810 INFO L158 Benchmark]: Toolchain (without parser) took 497.20ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 78.8MB in the beginning and 184.4MB in the end (delta: -105.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 11:44:30,811 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 103.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:44:30,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.34ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 78.6MB in the beginning and 184.4MB in the end (delta: -105.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 11:44:30,813 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.09ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 103.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.34ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 78.6MB in the beginning and 184.4MB in the end (delta: -105.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: 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_BER_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:44:32,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:44:32,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:44:32,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:44:32,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:44:32,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:44:32,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:44:32,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:44:32,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:44:32,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:44:32,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:44:32,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:44:32,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:44:32,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:44:32,563 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:44:32,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:44:32,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:44:32,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:44:32,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:44:32,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:44:32,566 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:44:32,566 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:44:32,567 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:44:32,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:44:32,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:44:32,567 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:44:32,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:44:32,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:44:32,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:44:32,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:44:32,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:44:32,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:44:32,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:44:32,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:44:32,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:44:32,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:44:32,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:44:32,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:44:32,570 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:44:32,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:44:32,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:44:32,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:44:32,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:44:32,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:44:32,572 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:44:32,573 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-13 11:44:32,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:44:32,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:44:32,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:44:32,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:44:32,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:44:32,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 11:44:34,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:44:34,384 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:44:34,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 11:44:34,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e1cf986/c95f99c61ea14b329d019415b266aca5/FLAG0005a144e [2024-10-13 11:44:34,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e1cf986/c95f99c61ea14b329d019415b266aca5 [2024-10-13 11:44:34,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:44:34,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:44:34,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:34,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:44:34,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:44:34,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:34" (1/1) ... [2024-10-13 11:44:34,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37711280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:34, skipping insertion in model container [2024-10-13 11:44:34,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:34" (1/1) ... [2024-10-13 11:44:34,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:44:34,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:34,942 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:44:34,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:44:35,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:35,046 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:44:35,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:35,134 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:44:35,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35 WrapperNode [2024-10-13 11:44:35,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:35,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:44:35,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:44:35,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:44:35,143 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:44:35" (1/1) ... [2024-10-13 11:44:35,177 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:44:35" (1/1) ... [2024-10-13 11:44:35,242 INFO L138 Inliner]: procedures = 179, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1144 [2024-10-13 11:44:35,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:44:35,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:44:35,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:44:35,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:44:35,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,321 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-13 11:44:35,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:44:35,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:44:35,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:44:35,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:44:35,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:44:35,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:44:35,438 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:44:35,441 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:44:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:44:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:44:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:44:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:44:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:44:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:44:35,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:44:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:44:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:44:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:44:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:44:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:44:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:44:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:44:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:44:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:44:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:44:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:44:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:44:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:44:35,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:44:35,691 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:44:35,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:44:35,695 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:44:35,739 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:44:38,875 INFO L? ?]: Removed 1315 outVars from TransFormulas that were not future-live. [2024-10-13 11:44:38,876 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:44:39,024 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:44:39,026 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-13 11:44:39,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:39 BoogieIcfgContainer [2024-10-13 11:44:39,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:44:39,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:44:39,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:44:39,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:44:39,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:44:34" (1/3) ... [2024-10-13 11:44:39,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366617d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:44:39, skipping insertion in model container [2024-10-13 11:44:39,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (2/3) ... [2024-10-13 11:44:39,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366617d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:44:39, skipping insertion in model container [2024-10-13 11:44:39,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:39" (3/3) ... [2024-10-13 11:44:39,032 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2024-10-13 11:44:39,045 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:44:39,045 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-10-13 11:44:39,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:44:39,109 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;@326e1386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:44:39,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-10-13 11:44:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 1109 states, 479 states have (on average 2.549060542797495) internal successors, (1221), 1101 states have internal predecessors, (1221), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:44:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:44:39,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:39,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:44:39,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:39,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1798641, now seen corresponding path program 1 times [2024-10-13 11:44:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387035640] [2024-10-13 11:44:39,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:39,136 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:44:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:39,137 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:44:39,138 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:44:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:39,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:44:39,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:39,280 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:44:39,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:39,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:39,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387035640] [2024-10-13 11:44:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387035640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:39,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:39,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:44:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473296268] [2024-10-13 11:44:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:39,327 INFO L87 Difference]: Start difference. First operand has 1109 states, 479 states have (on average 2.549060542797495) internal successors, (1221), 1101 states have internal predecessors, (1221), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:44:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:40,769 INFO L93 Difference]: Finished difference Result 1111 states and 1169 transitions. [2024-10-13 11:44:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-13 11:44:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:40,792 INFO L225 Difference]: With dead ends: 1111 [2024-10-13 11:44:40,793 INFO L226 Difference]: Without dead ends: 1108 [2024-10-13 11:44:40,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:44:40,801 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 23 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:40,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1547 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:44:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-10-13 11:44:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1099. [2024-10-13 11:44:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 480 states have (on average 2.3958333333333335) internal successors, (1150), 1091 states have internal predecessors, (1150), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:44:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1162 transitions. [2024-10-13 11:44:40,913 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1162 transitions. Word has length 3 [2024-10-13 11:44:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:40,913 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1162 transitions. [2024-10-13 11:44:40,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:44:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1162 transitions. [2024-10-13 11:44:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:44:40,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:40,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:44:40,917 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:44:41,114 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:44:41,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:41,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:41,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1726838456, now seen corresponding path program 1 times [2024-10-13 11:44:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546139505] [2024-10-13 11:44:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:41,117 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:44:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:41,120 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:44:41,121 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:44:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:41,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:41,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:41,229 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:44:41,237 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:44:41,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:41,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546139505] [2024-10-13 11:44:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546139505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501917646] [2024-10-13 11:44:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:41,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:41,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:41,240 INFO L87 Difference]: Start difference. First operand 1099 states and 1162 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:42,633 INFO L93 Difference]: Finished difference Result 1005 states and 1066 transitions. [2024-10-13 11:44:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:42,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 11:44:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:42,638 INFO L225 Difference]: With dead ends: 1005 [2024-10-13 11:44:42,638 INFO L226 Difference]: Without dead ends: 1005 [2024-10-13 11:44:42,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:44:42,639 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 913 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:42,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 442 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:44:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-13 11:44:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2024-10-13 11:44:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 480 states have (on average 2.1958333333333333) internal successors, (1054), 997 states have internal predecessors, (1054), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:44:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1066 transitions. [2024-10-13 11:44:42,665 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1066 transitions. Word has length 5 [2024-10-13 11:44:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:42,665 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1066 transitions. [2024-10-13 11:44:42,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1066 transitions. [2024-10-13 11:44:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:44:42,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:42,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:44:42,670 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 11:44:42,866 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 11:44:42,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:42,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1726838457, now seen corresponding path program 1 times [2024-10-13 11:44:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:42,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410262094] [2024-10-13 11:44:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:42,868 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:44:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:42,869 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 11:44:42,871 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 11:44:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:42,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:44:42,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:42,962 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:44:42,980 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:44:42,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:42,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410262094] [2024-10-13 11:44:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410262094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268020383] [2024-10-13 11:44:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:42,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:42,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:42,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:42,982 INFO L87 Difference]: Start difference. First operand 1005 states and 1066 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:44,776 INFO L93 Difference]: Finished difference Result 1285 states and 1366 transitions. [2024-10-13 11:44:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:44,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 11:44:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:44,779 INFO L225 Difference]: With dead ends: 1285 [2024-10-13 11:44:44,779 INFO L226 Difference]: Without dead ends: 1285 [2024-10-13 11:44:44,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:44:44,782 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 464 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:44,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1090 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:44:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2024-10-13 11:44:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1134. [2024-10-13 11:44:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 619 states have (on average 2.158319870759289) internal successors, (1336), 1126 states have internal predecessors, (1336), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 11:44:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1348 transitions. [2024-10-13 11:44:44,799 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1348 transitions. Word has length 5 [2024-10-13 11:44:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:44,799 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1348 transitions. [2024-10-13 11:44:44,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1348 transitions. [2024-10-13 11:44:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:44:44,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:44,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:44:44,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 11:44:45,000 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 11:44:45,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:45,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1994044088, now seen corresponding path program 1 times [2024-10-13 11:44:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976689475] [2024-10-13 11:44:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:45,002 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:44:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:45,004 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 11:44:45,006 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 11:44:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:45,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:44:45,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:45,139 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:44:45,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:45,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976689475] [2024-10-13 11:44:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976689475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:45,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:44:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544667595] [2024-10-13 11:44:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:45,141 INFO L87 Difference]: Start difference. First operand 1134 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 1.5) 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 11:44:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:46,374 INFO L93 Difference]: Finished difference Result 1811 states and 2151 transitions. [2024-10-13 11:44:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:46,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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 11:44:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:46,382 INFO L225 Difference]: With dead ends: 1811 [2024-10-13 11:44:46,382 INFO L226 Difference]: Without dead ends: 1809 [2024-10-13 11:44:46,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:46,382 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 620 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:46,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 2540 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:44:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-10-13 11:44:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1510. [2024-10-13 11:44:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 995 states have (on average 2.141708542713568) internal successors, (2131), 1499 states have internal predecessors, (2131), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2149 transitions. [2024-10-13 11:44:46,407 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2149 transitions. Word has length 6 [2024-10-13 11:44:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:46,407 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2149 transitions. [2024-10-13 11:44:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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 11:44:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2149 transitions. [2024-10-13 11:44:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:44:46,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:46,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:46,412 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 11:44:46,610 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 11:44:46,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -46324254, now seen corresponding path program 1 times [2024-10-13 11:44:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434994847] [2024-10-13 11:44:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:46,611 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:44:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:46,614 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 11:44:46,615 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 11:44:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:46,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:44:46,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:46,729 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:44:46,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:46,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434994847] [2024-10-13 11:44:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434994847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:44:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516791725] [2024-10-13 11:44:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:46,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:46,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:46,731 INFO L87 Difference]: Start difference. First operand 1510 states and 2149 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:44:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:47,231 INFO L93 Difference]: Finished difference Result 1456 states and 2069 transitions. [2024-10-13 11:44:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-13 11:44:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:47,238 INFO L225 Difference]: With dead ends: 1456 [2024-10-13 11:44:47,238 INFO L226 Difference]: Without dead ends: 1456 [2024-10-13 11:44:47,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:44:47,239 INFO L432 NwaCegarLoop]: 870 mSDtfsCounter, 61 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:47,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1698 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:44:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-10-13 11:44:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2024-10-13 11:44:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 965 states have (on average 2.1253886010362693) internal successors, (2051), 1445 states have internal predecessors, (2051), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2069 transitions. [2024-10-13 11:44:47,258 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2069 transitions. Word has length 11 [2024-10-13 11:44:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:47,258 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2069 transitions. [2024-10-13 11:44:47,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:44:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2069 transitions. [2024-10-13 11:44:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 11:44:47,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:47,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:47,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 11:44:47,459 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 11:44:47,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1567938852, now seen corresponding path program 1 times [2024-10-13 11:44:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486824743] [2024-10-13 11:44:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:47,461 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:44:47,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:47,462 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 11:44:47,463 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 11:44:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:47,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:47,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:47,588 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:44:47,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:47,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486824743] [2024-10-13 11:44:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486824743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:47,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:44:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745454496] [2024-10-13 11:44:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:47,592 INFO L87 Difference]: Start difference. First operand 1456 states and 2069 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:48,330 INFO L93 Difference]: Finished difference Result 1440 states and 2025 transitions. [2024-10-13 11:44:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:44:48,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 11:44:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:48,335 INFO L225 Difference]: With dead ends: 1440 [2024-10-13 11:44:48,335 INFO L226 Difference]: Without dead ends: 1440 [2024-10-13 11:44:48,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:44:48,336 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 45 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:48,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2499 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:44:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-10-13 11:44:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2024-10-13 11:44:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 963 states have (on average 2.0841121495327104) internal successors, (2007), 1429 states have internal predecessors, (2007), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2025 transitions. [2024-10-13 11:44:48,352 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2025 transitions. Word has length 13 [2024-10-13 11:44:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2025 transitions. [2024-10-13 11:44:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2025 transitions. [2024-10-13 11:44:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:44:48,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:48,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:48,357 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:44:48,554 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 11:44:48,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:48,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash 572631978, now seen corresponding path program 1 times [2024-10-13 11:44:48,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:48,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868977774] [2024-10-13 11:44:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:48,555 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:44:48,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:48,556 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 11:44:48,557 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 11:44:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:48,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:44:48,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:48,668 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:44:48,712 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:44:48,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:48,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868977774] [2024-10-13 11:44:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868977774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:48,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:48,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:44:48,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602992487] [2024-10-13 11:44:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:48,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:48,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:48,714 INFO L87 Difference]: Start difference. First operand 1440 states and 2025 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:44:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:50,229 INFO L93 Difference]: Finished difference Result 1444 states and 2025 transitions. [2024-10-13 11:44:50,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:50,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-13 11:44:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:50,234 INFO L225 Difference]: With dead ends: 1444 [2024-10-13 11:44:50,234 INFO L226 Difference]: Without dead ends: 1444 [2024-10-13 11:44:50,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 11:44:50,235 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 857 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:50,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 760 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 11:44:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-10-13 11:44:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1436. [2024-10-13 11:44:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 963 states have (on average 2.075804776739356) internal successors, (1999), 1425 states have internal predecessors, (1999), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2017 transitions. [2024-10-13 11:44:50,256 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2017 transitions. Word has length 27 [2024-10-13 11:44:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:50,257 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2017 transitions. [2024-10-13 11:44:50,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:44:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2017 transitions. [2024-10-13 11:44:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 11:44:50,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:50,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:50,262 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 11:44:50,458 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 11:44:50,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:50,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash 572631979, now seen corresponding path program 1 times [2024-10-13 11:44:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989103002] [2024-10-13 11:44:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:50,463 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 11:44:50,464 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 11:44:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:50,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:44:50,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:50,577 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:44:50,737 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:44:50,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:50,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989103002] [2024-10-13 11:44:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989103002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:50,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:44:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5087436] [2024-10-13 11:44:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:50,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:50,739 INFO L87 Difference]: Start difference. First operand 1436 states and 2017 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:44:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:53,056 INFO L93 Difference]: Finished difference Result 1592 states and 2038 transitions. [2024-10-13 11:44:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:53,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-10-13 11:44:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:53,063 INFO L225 Difference]: With dead ends: 1592 [2024-10-13 11:44:53,063 INFO L226 Difference]: Without dead ends: 1592 [2024-10-13 11:44:53,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 11:44:53,064 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 404 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:53,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1531 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 11:44:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-10-13 11:44:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1432. [2024-10-13 11:44:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 963 states have (on average 2.067497403946002) internal successors, (1991), 1421 states have internal predecessors, (1991), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2009 transitions. [2024-10-13 11:44:53,082 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2009 transitions. Word has length 27 [2024-10-13 11:44:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:53,082 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2009 transitions. [2024-10-13 11:44:53,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:44:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2009 transitions. [2024-10-13 11:44:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 11:44:53,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:53,083 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] [2024-10-13 11:44:53,088 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 11:44:53,284 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 11:44:53,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 768916005, now seen corresponding path program 1 times [2024-10-13 11:44:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637179073] [2024-10-13 11:44:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:53,285 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:44:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:53,286 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 11:44:53,287 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 11:44:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:53,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:53,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:53,461 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:44:53,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:53,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637179073] [2024-10-13 11:44:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637179073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:53,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:44:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669095810] [2024-10-13 11:44:53,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:53,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:53,463 INFO L87 Difference]: Start difference. First operand 1432 states and 2009 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:44:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:54,102 INFO L93 Difference]: Finished difference Result 1420 states and 1989 transitions. [2024-10-13 11:44:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:44:54,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2024-10-13 11:44:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:54,107 INFO L225 Difference]: With dead ends: 1420 [2024-10-13 11:44:54,107 INFO L226 Difference]: Without dead ends: 1420 [2024-10-13 11:44:54,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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 11:44:54,107 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 15 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:54,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2482 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:44:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-10-13 11:44:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2024-10-13 11:44:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 951 states have (on average 2.0725552050473186) internal successors, (1971), 1409 states have internal predecessors, (1971), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1989 transitions. [2024-10-13 11:44:54,141 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1989 transitions. Word has length 43 [2024-10-13 11:44:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:54,143 INFO L471 AbstractCegarLoop]: Abstraction has 1420 states and 1989 transitions. [2024-10-13 11:44:54,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:44:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1989 transitions. [2024-10-13 11:44:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 11:44:54,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:54,144 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] [2024-10-13 11:44:54,154 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 11:44:54,344 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 11:44:54,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash -286582395, now seen corresponding path program 1 times [2024-10-13 11:44:54,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590516276] [2024-10-13 11:44:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:54,346 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:44:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:54,349 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 11:44:54,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:44:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:54,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:54,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:54,659 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:44:54,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:54,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590516276] [2024-10-13 11:44:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590516276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533990985] [2024-10-13 11:44:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:54,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:54,662 INFO L87 Difference]: Start difference. First operand 1420 states and 1989 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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:44:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:55,196 INFO L93 Difference]: Finished difference Result 1310 states and 1763 transitions. [2024-10-13 11:44:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2024-10-13 11:44:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:55,199 INFO L225 Difference]: With dead ends: 1310 [2024-10-13 11:44:55,200 INFO L226 Difference]: Without dead ends: 1310 [2024-10-13 11:44:55,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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:44:55,200 INFO L432 NwaCegarLoop]: 848 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:55,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1669 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:44:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-10-13 11:44:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2024-10-13 11:44:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 841 states have (on average 2.074910820451843) internal successors, (1745), 1299 states have internal predecessors, (1745), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1763 transitions. [2024-10-13 11:44:55,219 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1763 transitions. Word has length 47 [2024-10-13 11:44:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:55,219 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1763 transitions. [2024-10-13 11:44:55,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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:44:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1763 transitions. [2024-10-13 11:44:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 11:44:55,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:55,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:55,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 11:44:55,422 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 11:44:55,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash 711357344, now seen corresponding path program 1 times [2024-10-13 11:44:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:55,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597781809] [2024-10-13 11:44:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:55,423 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:44:55,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:55,424 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 11:44:55,425 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 11:44:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:55,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:44:55,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:55,673 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:44:55,678 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:44:55,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:44:55,993 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 11:44:56,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:44:56,009 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 11:44:56,019 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:44:56,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:56,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597781809] [2024-10-13 11:44:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597781809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:44:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172293630] [2024-10-13 11:44:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:56,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:56,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:56,021 INFO L87 Difference]: Start difference. First operand 1310 states and 1763 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:57,261 INFO L93 Difference]: Finished difference Result 1226 states and 1638 transitions. [2024-10-13 11:44:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:57,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-13 11:44:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:57,264 INFO L225 Difference]: With dead ends: 1226 [2024-10-13 11:44:57,264 INFO L226 Difference]: Without dead ends: 1226 [2024-10-13 11:44:57,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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 11:44:57,265 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 1564 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:57,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 221 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:44:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-10-13 11:44:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1087. [2024-10-13 11:44:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 702 states have (on average 1.8917378917378918) internal successors, (1328), 1076 states have internal predecessors, (1328), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1346 transitions. [2024-10-13 11:44:57,276 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1346 transitions. Word has length 50 [2024-10-13 11:44:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:57,276 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1346 transitions. [2024-10-13 11:44:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1346 transitions. [2024-10-13 11:44:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 11:44:57,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:57,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:57,286 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 11:44:57,479 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 11:44:57,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1000351691, now seen corresponding path program 1 times [2024-10-13 11:44:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837251904] [2024-10-13 11:44:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:57,483 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:44:57,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:57,485 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 11:44:57,486 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 11:44:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:57,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:44:57,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:57,686 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:44:57,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:44:57,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:44:57,728 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:44:57,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:57,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:57,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837251904] [2024-10-13 11:44:57,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837251904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:57,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:57,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:44:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522937875] [2024-10-13 11:44:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:57,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:44:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:44:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:44:57,729 INFO L87 Difference]: Start difference. First operand 1087 states and 1346 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:59,464 INFO L93 Difference]: Finished difference Result 1086 states and 1344 transitions. [2024-10-13 11:44:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:44:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-13 11:44:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:59,468 INFO L225 Difference]: With dead ends: 1086 [2024-10-13 11:44:59,468 INFO L226 Difference]: Without dead ends: 1086 [2024-10-13 11:44:59,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:44:59,468 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:59,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1926 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:44:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-10-13 11:44:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2024-10-13 11:44:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 702 states have (on average 1.8888888888888888) internal successors, (1326), 1075 states have internal predecessors, (1326), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:44:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1344 transitions. [2024-10-13 11:44:59,478 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1344 transitions. Word has length 54 [2024-10-13 11:44:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:59,479 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1344 transitions. [2024-10-13 11:44:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1344 transitions. [2024-10-13 11:44:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 11:44:59,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:59,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:59,485 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 11:44:59,680 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 11:44:59,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:44:59,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1000351692, now seen corresponding path program 1 times [2024-10-13 11:44:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461147434] [2024-10-13 11:44:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:59,681 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:44:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:59,684 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 11:44:59,684 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 11:44:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:59,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:44:59,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:59,867 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:44:59,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:44:59,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:44:59,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:44:59,928 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:44:59,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:59,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461147434] [2024-10-13 11:44:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461147434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:44:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722760532] [2024-10-13 11:44:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:59,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:44:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:44:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:44:59,929 INFO L87 Difference]: Start difference. First operand 1086 states and 1344 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:02,218 INFO L93 Difference]: Finished difference Result 1085 states and 1342 transitions. [2024-10-13 11:45:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:45:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-13 11:45:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:02,221 INFO L225 Difference]: With dead ends: 1085 [2024-10-13 11:45:02,222 INFO L226 Difference]: Without dead ends: 1085 [2024-10-13 11:45:02,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:45:02,223 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:02,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1941 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 11:45:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-10-13 11:45:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-10-13 11:45:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 700 states have (on average 1.8914285714285715) internal successors, (1324), 1074 states have internal predecessors, (1324), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 11:45:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1342 transitions. [2024-10-13 11:45:02,235 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1342 transitions. Word has length 54 [2024-10-13 11:45:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:02,235 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1342 transitions. [2024-10-13 11:45:02,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1342 transitions. [2024-10-13 11:45:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 11:45:02,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:02,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:02,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:45:02,440 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 11:45:02,441 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:45:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash -408802097, now seen corresponding path program 1 times [2024-10-13 11:45:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675012375] [2024-10-13 11:45:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:02,443 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 11:45:02,444 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 11:45:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:02,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:45:02,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:02,648 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:45:02,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:02,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675012375] [2024-10-13 11:45:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675012375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:02,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:02,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117906907] [2024-10-13 11:45:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:02,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:02,652 INFO L87 Difference]: Start difference. First operand 1085 states and 1342 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:45:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:03,273 INFO L93 Difference]: Finished difference Result 1087 states and 1347 transitions. [2024-10-13 11:45:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2024-10-13 11:45:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:03,280 INFO L225 Difference]: With dead ends: 1087 [2024-10-13 11:45:03,280 INFO L226 Difference]: Without dead ends: 1087 [2024-10-13 11:45:03,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:03,280 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 0 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:03,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2274 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:45:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-13 11:45:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2024-10-13 11:45:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 701 states have (on average 1.891583452211127) internal successors, (1326), 1076 states have internal predecessors, (1326), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 11:45:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1347 transitions. [2024-10-13 11:45:03,297 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1347 transitions. Word has length 60 [2024-10-13 11:45:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:03,298 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1347 transitions. [2024-10-13 11:45:03,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:45:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1347 transitions. [2024-10-13 11:45:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 11:45:03,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:03,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:03,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:45:03,499 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 11:45:03,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:45:03,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -555930372, now seen corresponding path program 1 times [2024-10-13 11:45:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039846543] [2024-10-13 11:45:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:03,501 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:45:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:03,504 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 11:45:03,504 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 11:45:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:03,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:45:03,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:03,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:03,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039846543] [2024-10-13 11:45:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039846543] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:03,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:45:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42937930] [2024-10-13 11:45:03,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:45:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:45:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:45:03,784 INFO L87 Difference]: Start difference. First operand 1087 states and 1347 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:04,790 INFO L93 Difference]: Finished difference Result 1096 states and 1363 transitions. [2024-10-13 11:45:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:45:04,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2024-10-13 11:45:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:04,794 INFO L225 Difference]: With dead ends: 1096 [2024-10-13 11:45:04,794 INFO L226 Difference]: Without dead ends: 1096 [2024-10-13 11:45:04,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:45:04,795 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 5 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3776 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:04,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3776 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:45:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-10-13 11:45:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1095. [2024-10-13 11:45:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 708 states have (on average 1.8912429378531073) internal successors, (1339), 1083 states have internal predecessors, (1339), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 11:45:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1360 transitions. [2024-10-13 11:45:04,809 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1360 transitions. Word has length 61 [2024-10-13 11:45:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:04,810 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1360 transitions. [2024-10-13 11:45:04,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1360 transitions. [2024-10-13 11:45:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:45:04,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:04,811 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:04,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 11:45:05,011 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 11:45:05,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:45:05,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1584877583, now seen corresponding path program 2 times [2024-10-13 11:45:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449062693] [2024-10-13 11:45:05,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:45:05,013 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:45:05,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:05,014 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 11:45:05,014 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 11:45:05,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:45:05,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:05,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:45:05,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:05,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:05,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449062693] [2024-10-13 11:45:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449062693] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:05,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:45:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095391625] [2024-10-13 11:45:05,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:45:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:45:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:45:05,506 INFO L87 Difference]: Start difference. First operand 1095 states and 1360 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:06,940 INFO L93 Difference]: Finished difference Result 1107 states and 1381 transitions. [2024-10-13 11:45:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:45:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2024-10-13 11:45:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:06,947 INFO L225 Difference]: With dead ends: 1107 [2024-10-13 11:45:06,947 INFO L226 Difference]: Without dead ends: 1105 [2024-10-13 11:45:06,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:45:06,948 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 7 mSDsluCounter, 3780 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:06,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4538 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 11:45:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-10-13 11:45:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1104. [2024-10-13 11:45:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 717 states have (on average 1.8842398884239888) internal successors, (1351), 1092 states have internal predecessors, (1351), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 11:45:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1372 transitions. [2024-10-13 11:45:06,959 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1372 transitions. Word has length 64 [2024-10-13 11:45:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:06,959 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1372 transitions. [2024-10-13 11:45:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1372 transitions. [2024-10-13 11:45:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 11:45:06,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:06,960 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:06,967 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 11:45:07,160 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 11:45:07,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:45:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -606521105, now seen corresponding path program 3 times [2024-10-13 11:45:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084800844] [2024-10-13 11:45:07,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:45:07,162 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:45:07,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:07,163 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 11:45:07,163 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 11:45:07,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:45:07,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:07,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:45:07,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:07,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:08,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084800844] [2024-10-13 11:45:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084800844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:08,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:45:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983462907] [2024-10-13 11:45:08,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:08,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:45:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:08,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:45:08,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:45:08,175 INFO L87 Difference]: Start difference. First operand 1104 states and 1372 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:11,638 INFO L93 Difference]: Finished difference Result 1125 states and 1408 transitions. [2024-10-13 11:45:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:45:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-10-13 11:45:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:11,641 INFO L225 Difference]: With dead ends: 1125 [2024-10-13 11:45:11,641 INFO L226 Difference]: Without dead ends: 1122 [2024-10-13 11:45:11,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 11:45:11,642 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 13 mSDsluCounter, 9064 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9822 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:11,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9822 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:45:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-13 11:45:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2024-10-13 11:45:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 735 states have (on average 1.8693877551020408) internal successors, (1374), 1110 states have internal predecessors, (1374), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 11:45:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1395 transitions. [2024-10-13 11:45:11,653 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1395 transitions. Word has length 70 [2024-10-13 11:45:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1395 transitions. [2024-10-13 11:45:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1395 transitions. [2024-10-13 11:45:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 11:45:11,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:11,654 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:11,666 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 11:45:11,854 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 11:45:11,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:45:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -536046929, now seen corresponding path program 4 times [2024-10-13 11:45:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065198363] [2024-10-13 11:45:11,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:45:11,856 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:45:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:11,858 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 11:45:11,859 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 11:45:12,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:45:12,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:12,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 11:45:12,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:12,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:13,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065198363] [2024-10-13 11:45:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065198363] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:13,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:45:13,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575534368] [2024-10-13 11:45:13,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:45:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:45:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:45:13,446 INFO L87 Difference]: Start difference. First operand 1122 states and 1395 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:21,251 INFO L93 Difference]: Finished difference Result 1159 states and 1466 transitions. [2024-10-13 11:45:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:45:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-10-13 11:45:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:21,255 INFO L225 Difference]: With dead ends: 1159 [2024-10-13 11:45:21,255 INFO L226 Difference]: Without dead ends: 1157 [2024-10-13 11:45:21,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:45:21,257 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 25 mSDsluCounter, 17388 mSDsCounter, 0 mSdLazyCounter, 4572 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18146 SdHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:21,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18146 Invalid, 4645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4572 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-13 11:45:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-13 11:45:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-13 11:45:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 769 states have (on average 1.846553966189857) internal successors, (1420), 1144 states have internal predecessors, (1420), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 11:45:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1441 transitions. [2024-10-13 11:45:21,267 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1441 transitions. Word has length 82 [2024-10-13 11:45:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:21,268 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1441 transitions. [2024-10-13 11:45:21,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1441 transitions. [2024-10-13 11:45:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 11:45:21,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:21,269 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:21,279 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 11:45:21,469 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 11:45:21,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-13 11:45:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -908898161, now seen corresponding path program 5 times [2024-10-13 11:45:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934485034] [2024-10-13 11:45:21,470 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:45:21,471 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:45:21,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:21,473 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 11:45:21,475 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 11:45:22,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:45:22,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:22,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 11:45:22,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:22,543 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 11:45:22,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-13 11:45:22,827 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-13 11:45:22,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-13 11:45:22,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:45:23,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-13 11:45:24,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:45:24,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-13 11:45:24,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-13 11:45:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 11:45:24,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:25,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1648) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2024-10-13 11:45:25,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934485034] [2024-10-13 11:45:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934485034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:45:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1465925555] [2024-10-13 11:45:25,202 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:45:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:45:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:45:25,204 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:45:25,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process