./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:06:20,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:06:20,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:06:20,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:06:20,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:06:20,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:06:20,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:06:20,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:06:20,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:06:20,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:06:20,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:06:20,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:06:20,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:06:20,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:06:20,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:06:20,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:06:20,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:06:20,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:06:20,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:06:20,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:06:20,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:06:20,413 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:06:20,413 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:06:20,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:06:20,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:06:20,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:06:20,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:06:20,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:06:20,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:06:20,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:06:20,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:06:20,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:06:20,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:06:20,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:06:20,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:06:20,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:06:20,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:06:20,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:06:20,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:06:20,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:06:20,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:06:20,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:06:20,424 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 -> 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 [2024-11-09 10:06:20,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:06:20,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:06:20,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:06:20,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:06:20,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:06:20,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-09 10:06:22,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:06:22,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:06:22,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-09 10:06:22,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94edcafc8/d9e7ad45c0db4f01b33123102f98bb2c/FLAGcbec742b1 [2024-11-09 10:06:22,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94edcafc8/d9e7ad45c0db4f01b33123102f98bb2c [2024-11-09 10:06:22,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:06:22,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:06:22,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:06:22,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:06:22,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:06:22,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:06:22" (1/1) ... [2024-11-09 10:06:22,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4442eb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:22, skipping insertion in model container [2024-11-09 10:06:22,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:06:22" (1/1) ... [2024-11-09 10:06:22,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:06:23,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,145 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,150 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,158 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,189 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,191 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,198 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:23,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:06:23,226 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 10:06:23,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d49ee18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:23, skipping insertion in model container [2024-11-09 10:06:23,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:06:23,227 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:06:23,229 INFO L158 Benchmark]: Toolchain (without parser) took 639.39ms. Allocated memory is still 165.7MB. Free memory was 107.6MB in the beginning and 86.7MB in the end (delta: 21.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:06:23,230 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 165.7MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:06:23,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.37ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 86.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:06:23,231 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.23ms. Allocated memory is still 165.7MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.37ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 86.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:06:25,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:06:25,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:06:25,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:06:25,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:06:25,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:06:25,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:06:25,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:06:25,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:06:25,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:06:25,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:06:25,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:06:25,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:06:25,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:06:25,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:06:25,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:06:25,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:06:25,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:06:25,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:06:25,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:06:25,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:06:25,472 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:06:25,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:06:25,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:06:25,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:06:25,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:06:25,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:06:25,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:06:25,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:06:25,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:06:25,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:06:25,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:06:25,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:06:25,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:06:25,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:06:25,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:06:25,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:06:25,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:06:25,477 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:06:25,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:06:25,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:06:25,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:06:25,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:06:25,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:06:25,478 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 -> 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 [2024-11-09 10:06:25,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:06:25,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:06:25,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:06:25,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:06:25,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:06:25,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-09 10:06:27,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:06:27,750 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:06:27,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2024-11-09 10:06:27,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009638a0f/3cfd6db8985a4e63bbce7e58de0f53a0/FLAG076570977 [2024-11-09 10:06:27,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009638a0f/3cfd6db8985a4e63bbce7e58de0f53a0 [2024-11-09 10:06:27,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:06:27,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:06:27,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:06:27,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:06:27,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:06:27,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:06:27" (1/1) ... [2024-11-09 10:06:27,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693f7518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:27, skipping insertion in model container [2024-11-09 10:06:27,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:06:27" (1/1) ... [2024-11-09 10:06:27,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:06:28,292 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,333 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,342 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,348 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,358 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,378 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,379 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,384 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,386 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,387 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,398 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:06:28,427 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:06:28,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:06:28,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,485 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,488 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,505 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,525 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,526 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,531 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,532 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,536 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,536 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,539 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:06:28,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:06:28,550 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:06:28,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:06:28,658 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:06:28,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28 WrapperNode [2024-11-09 10:06:28,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:06:28,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:06:28,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:06:28,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:06:28,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,782 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 807 [2024-11-09 10:06:28,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:06:28,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:06:28,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:06:28,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:06:28,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,922 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-09 10:06:28,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:28,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:29,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:29,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:06:29,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:06:29,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:06:29,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:06:29,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (1/1) ... [2024-11-09 10:06:29,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:06:29,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:29,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:06:29,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:06:29,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:06:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:06:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:06:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:06:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:06:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:06:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:06:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:06:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:06:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:06:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:06:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:06:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:06:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:06:29,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:06:29,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:06:29,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:06:29,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:06:29,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:06:29,341 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:06:29,406 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:06:32,525 INFO L? ?]: Removed 907 outVars from TransFormulas that were not future-live. [2024-11-09 10:06:32,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:06:32,563 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:06:32,563 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-09 10:06:32,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:06:32 BoogieIcfgContainer [2024-11-09 10:06:32,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:06:32,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:06:32,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:06:32,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:06:32,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:06:27" (1/3) ... [2024-11-09 10:06:32,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716d5571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:06:32, skipping insertion in model container [2024-11-09 10:06:32,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:06:28" (2/3) ... [2024-11-09 10:06:32,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716d5571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:06:32, skipping insertion in model container [2024-11-09 10:06:32,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:06:32" (3/3) ... [2024-11-09 10:06:32,572 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-2.i [2024-11-09 10:06:32,588 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:06:32,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-09 10:06:32,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:06:32,679 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;@4779c137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:06:32,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-09 10:06:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:06:32,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:32,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:06:32,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:32,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-09 10:06:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:32,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217910558] [2024-11-09 10:06:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:32,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:32,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:32,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:06:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:32,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:06:32,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:32,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:06:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:32,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:32,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217910558] [2024-11-09 10:06:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217910558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:32,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:06:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899815517] [2024-11-09 10:06:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:06:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:06:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:32,990 INFO L87 Difference]: Start difference. First operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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-11-09 10:06:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:34,667 INFO L93 Difference]: Finished difference Result 801 states and 859 transitions. [2024-11-09 10:06:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:06:34,670 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-11-09 10:06:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:34,691 INFO L225 Difference]: With dead ends: 801 [2024-11-09 10:06:34,691 INFO L226 Difference]: Without dead ends: 799 [2024-11-09 10:06:34,693 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-11-09 10:06:34,697 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 535 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:34,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 663 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:06:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-09 10:06:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797. [2024-11-09 10:06:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 414 states have (on average 2.0) internal successors, (828), 791 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 854 transitions. [2024-11-09 10:06:34,791 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 854 transitions. Word has length 5 [2024-11-09 10:06:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:34,792 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 854 transitions. [2024-11-09 10:06:34,792 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-11-09 10:06:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 854 transitions. [2024-11-09 10:06:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:06:34,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:34,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:06:34,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:06:34,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:34,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:34,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-09 10:06:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026108376] [2024-11-09 10:06:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:34,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:35,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:35,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:06:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:35,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:06:35,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:35,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:35,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:35,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026108376] [2024-11-09 10:06:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026108376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:35,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:06:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901564797] [2024-11-09 10:06:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:35,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:06:35,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:06:35,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:35,128 INFO L87 Difference]: Start difference. First operand 797 states and 854 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-11-09 10:06:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:36,507 INFO L93 Difference]: Finished difference Result 872 states and 933 transitions. [2024-11-09 10:06:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:06:36,508 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-11-09 10:06:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:36,511 INFO L225 Difference]: With dead ends: 872 [2024-11-09 10:06:36,512 INFO L226 Difference]: Without dead ends: 872 [2024-11-09 10:06:36,512 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-11-09 10:06:36,513 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 263 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:36,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1050 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:06:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-09 10:06:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 824. [2024-11-09 10:06:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 451 states have (on average 1.9778270509977827) internal successors, (892), 818 states have internal predecessors, (892), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 918 transitions. [2024-11-09 10:06:36,546 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 918 transitions. Word has length 5 [2024-11-09 10:06:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:36,547 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 918 transitions. [2024-11-09 10:06:36,547 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-11-09 10:06:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 918 transitions. [2024-11-09 10:06:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:06:36,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:36,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:06:36,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:06:36,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:36,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1422972308, now seen corresponding path program 1 times [2024-11-09 10:06:36,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919683536] [2024-11-09 10:06:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:36,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:36,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:06:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:36,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:06:36,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:36,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:36,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919683536] [2024-11-09 10:06:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919683536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:06:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89999597] [2024-11-09 10:06:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:36,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:06:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:06:36,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:36,868 INFO L87 Difference]: Start difference. First operand 824 states and 918 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:36,963 INFO L93 Difference]: Finished difference Result 1397 states and 1554 transitions. [2024-11-09 10:06:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:06:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 10:06:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:36,973 INFO L225 Difference]: With dead ends: 1397 [2024-11-09 10:06:36,973 INFO L226 Difference]: Without dead ends: 1397 [2024-11-09 10:06:36,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:36,976 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 555 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:36,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1893 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:06:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-09 10:06:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 825. [2024-11-09 10:06:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 452 states have (on average 1.9756637168141593) internal successors, (893), 819 states have internal predecessors, (893), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 919 transitions. [2024-11-09 10:06:37,001 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 919 transitions. Word has length 6 [2024-11-09 10:06:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:37,002 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 919 transitions. [2024-11-09 10:06:37,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 919 transitions. [2024-11-09 10:06:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:06:37,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:37,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:37,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:06:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:37,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:37,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-09 10:06:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724803891] [2024-11-09 10:06:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:37,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:37,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:37,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:06:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:37,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:06:37,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:37,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:37,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:37,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724803891] [2024-11-09 10:06:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724803891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:37,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:37,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:06:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575124284] [2024-11-09 10:06:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:37,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:06:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:37,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:06:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:37,359 INFO L87 Difference]: Start difference. First operand 825 states and 919 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-11-09 10:06:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:37,394 INFO L93 Difference]: Finished difference Result 783 states and 876 transitions. [2024-11-09 10:06:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:06:37,395 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-11-09 10:06:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:37,399 INFO L225 Difference]: With dead ends: 783 [2024-11-09 10:06:37,399 INFO L226 Difference]: Without dead ends: 783 [2024-11-09 10:06:37,400 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-11-09 10:06:37,402 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 71 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:37,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1515 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:06:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-09 10:06:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-11-09 10:06:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 434 states have (on average 1.9585253456221199) internal successors, (850), 777 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 876 transitions. [2024-11-09 10:06:37,429 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 876 transitions. Word has length 11 [2024-11-09 10:06:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:37,431 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 876 transitions. [2024-11-09 10:06:37,431 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-11-09 10:06:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 876 transitions. [2024-11-09 10:06:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:06:37,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:37,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:37,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:06:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:37,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times [2024-11-09 10:06:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098151520] [2024-11-09 10:06:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:37,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:37,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:37,638 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:37,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:06:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:37,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:06:37,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:37,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:37,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098151520] [2024-11-09 10:06:37,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098151520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:37,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:37,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:06:37,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12218599] [2024-11-09 10:06:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:37,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:06:37,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:06:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:37,791 INFO L87 Difference]: Start difference. First operand 783 states and 876 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-11-09 10:06:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:37,877 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions. [2024-11-09 10:06:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:06:37,877 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-11-09 10:06:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:37,880 INFO L225 Difference]: With dead ends: 761 [2024-11-09 10:06:37,880 INFO L226 Difference]: Without dead ends: 761 [2024-11-09 10:06:37,881 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-11-09 10:06:37,881 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 48 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:37,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:06:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-09 10:06:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2024-11-09 10:06:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 426 states have (on average 1.9272300469483568) internal successors, (821), 755 states have internal predecessors, (821), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 847 transitions. [2024-11-09 10:06:37,901 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 847 transitions. Word has length 13 [2024-11-09 10:06:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:37,903 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 847 transitions. [2024-11-09 10:06:37,903 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-11-09 10:06:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 847 transitions. [2024-11-09 10:06:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:06:37,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:37,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:37,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:06:38,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:38,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:38,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times [2024-11-09 10:06:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581232824] [2024-11-09 10:06:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:38,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:38,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:38,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:38,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:06:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:38,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:06:38,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:38,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:06:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:38,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:38,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581232824] [2024-11-09 10:06:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581232824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:06:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711881551] [2024-11-09 10:06:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:38,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:06:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:06:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:38,311 INFO L87 Difference]: Start difference. First operand 761 states and 847 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-11-09 10:06:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:39,699 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions. [2024-11-09 10:06:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:06:39,699 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-11-09 10:06:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:39,702 INFO L225 Difference]: With dead ends: 761 [2024-11-09 10:06:39,702 INFO L226 Difference]: Without dead ends: 761 [2024-11-09 10:06:39,703 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-11-09 10:06:39,703 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 472 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:39,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 944 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:06:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-09 10:06:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 757. [2024-11-09 10:06:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 426 states have (on average 1.9178403755868545) internal successors, (817), 751 states have internal predecessors, (817), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 843 transitions. [2024-11-09 10:06:39,718 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 843 transitions. Word has length 27 [2024-11-09 10:06:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:39,719 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 843 transitions. [2024-11-09 10:06:39,719 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-11-09 10:06:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 843 transitions. [2024-11-09 10:06:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:06:39,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:39,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:39,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:06:39,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:39,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times [2024-11-09 10:06:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572068404] [2024-11-09 10:06:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:39,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:39,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:06:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:40,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:06:40,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:40,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:40,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:40,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:40,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572068404] [2024-11-09 10:06:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572068404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:06:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85054430] [2024-11-09 10:06:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:40,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:06:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:06:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:40,241 INFO L87 Difference]: Start difference. First operand 757 states and 843 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-11-09 10:06:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:41,959 INFO L93 Difference]: Finished difference Result 805 states and 858 transitions. [2024-11-09 10:06:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:06:41,960 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-11-09 10:06:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:41,962 INFO L225 Difference]: With dead ends: 805 [2024-11-09 10:06:41,963 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 10:06:41,963 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-11-09 10:06:41,964 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 196 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:41,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1371 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:06:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 10:06:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 753. [2024-11-09 10:06:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 426 states have (on average 1.908450704225352) internal successors, (813), 747 states have internal predecessors, (813), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 839 transitions. [2024-11-09 10:06:41,987 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 839 transitions. Word has length 27 [2024-11-09 10:06:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:41,987 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 839 transitions. [2024-11-09 10:06:41,988 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-11-09 10:06:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 839 transitions. [2024-11-09 10:06:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 10:06:41,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:41,990 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-11-09 10:06:41,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:06:42,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:42,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:42,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times [2024-11-09 10:06:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651370933] [2024-11-09 10:06:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:42,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:06:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:42,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:06:42,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:42,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:42,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651370933] [2024-11-09 10:06:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651370933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:42,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:42,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:06:42,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783065145] [2024-11-09 10:06:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:42,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:06:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:06:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:42,431 INFO L87 Difference]: Start difference. First operand 753 states and 839 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-11-09 10:06:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:42,483 INFO L93 Difference]: Finished difference Result 747 states and 829 transitions. [2024-11-09 10:06:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:06:42,484 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-11-09 10:06:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:42,488 INFO L225 Difference]: With dead ends: 747 [2024-11-09 10:06:42,488 INFO L226 Difference]: Without dead ends: 747 [2024-11-09 10:06:42,488 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-11-09 10:06:42,489 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 21 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:42,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:06:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-09 10:06:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-11-09 10:06:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 420 states have (on average 1.911904761904762) internal successors, (803), 741 states have internal predecessors, (803), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 829 transitions. [2024-11-09 10:06:42,506 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 829 transitions. Word has length 43 [2024-11-09 10:06:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:42,506 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 829 transitions. [2024-11-09 10:06:42,507 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-11-09 10:06:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 829 transitions. [2024-11-09 10:06:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 10:06:42,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:42,508 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] [2024-11-09 10:06:42,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:06:42,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:42,709 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:42,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times [2024-11-09 10:06:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:42,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262450935] [2024-11-09 10:06:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:42,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:42,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:06:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:42,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:06:42,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:43,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:43,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262450935] [2024-11-09 10:06:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262450935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:43,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:06:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946517589] [2024-11-09 10:06:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:06:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:06:43,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:43,121 INFO L87 Difference]: Start difference. First operand 747 states and 829 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:43,268 INFO L93 Difference]: Finished difference Result 965 states and 1076 transitions. [2024-11-09 10:06:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:06:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2024-11-09 10:06:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:43,272 INFO L225 Difference]: With dead ends: 965 [2024-11-09 10:06:43,273 INFO L226 Difference]: Without dead ends: 965 [2024-11-09 10:06:43,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:06:43,273 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 178 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:43,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1512 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:06:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-09 10:06:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 794. [2024-11-09 10:06:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 467 states have (on average 1.8201284796573876) internal successors, (850), 788 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 876 transitions. [2024-11-09 10:06:43,288 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 876 transitions. Word has length 51 [2024-11-09 10:06:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 876 transitions. [2024-11-09 10:06:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 876 transitions. [2024-11-09 10:06:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 10:06:43,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:43,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:43,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:06:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:43,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:43,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times [2024-11-09 10:06:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155176702] [2024-11-09 10:06:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:43,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:43,500 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:43,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:06:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:43,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:06:43,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:43,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:43,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:06:44,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:06:44,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:06:44,285 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:06:44,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:06:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:44,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:44,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:44,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155176702] [2024-11-09 10:06:44,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155176702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:44,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:44,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:06:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552678640] [2024-11-09 10:06:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:44,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:06:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:06:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:44,300 INFO L87 Difference]: Start difference. First operand 794 states and 876 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:45,464 INFO L93 Difference]: Finished difference Result 756 states and 838 transitions. [2024-11-09 10:06:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:06:45,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 10:06:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:45,467 INFO L225 Difference]: With dead ends: 756 [2024-11-09 10:06:45,467 INFO L226 Difference]: Without dead ends: 756 [2024-11-09 10:06:45,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:45,468 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 374 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:45,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 682 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:06:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-09 10:06:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 719. [2024-11-09 10:06:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 430 states have (on average 1.716279069767442) internal successors, (738), 713 states have internal predecessors, (738), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 764 transitions. [2024-11-09 10:06:45,481 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 764 transitions. Word has length 54 [2024-11-09 10:06:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:45,482 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 764 transitions. [2024-11-09 10:06:45,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 764 transitions. [2024-11-09 10:06:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 10:06:45,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:45,483 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] [2024-11-09 10:06:45,494 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-11-09 10:06:45,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:45,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:45,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times [2024-11-09 10:06:45,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:45,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918518677] [2024-11-09 10:06:45,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:45,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:45,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:45,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:45,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:06:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:45,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:06:45,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:45,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:06:46,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:06:46,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 10:06:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:46,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:46,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918518677] [2024-11-09 10:06:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918518677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:06:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60897119] [2024-11-09 10:06:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:06:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:06:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:06:46,037 INFO L87 Difference]: Start difference. First operand 719 states and 764 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:47,184 INFO L93 Difference]: Finished difference Result 718 states and 763 transitions. [2024-11-09 10:06:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:06:47,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-09 10:06:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:47,187 INFO L225 Difference]: With dead ends: 718 [2024-11-09 10:06:47,187 INFO L226 Difference]: Without dead ends: 718 [2024-11-09 10:06:47,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:06:47,188 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 2 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:47,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1842 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:06:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-09 10:06:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-09 10:06:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 430 states have (on average 1.713953488372093) internal successors, (737), 712 states have internal predecessors, (737), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 763 transitions. [2024-11-09 10:06:47,199 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 763 transitions. Word has length 59 [2024-11-09 10:06:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:47,200 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 763 transitions. [2024-11-09 10:06:47,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 763 transitions. [2024-11-09 10:06:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 10:06:47,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:47,201 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] [2024-11-09 10:06:47,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 10:06:47,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:47,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:47,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:47,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times [2024-11-09 10:06:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:47,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215899249] [2024-11-09 10:06:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:47,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:47,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:47,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:06:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:47,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:06:47,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:47,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:47,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:06:47,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:06:47,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 10:06:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:47,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:47,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215899249] [2024-11-09 10:06:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215899249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:06:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299905961] [2024-11-09 10:06:47,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:06:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:47,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:06:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:06:47,714 INFO L87 Difference]: Start difference. First operand 718 states and 763 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:49,404 INFO L93 Difference]: Finished difference Result 717 states and 762 transitions. [2024-11-09 10:06:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:06:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-09 10:06:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:49,407 INFO L225 Difference]: With dead ends: 717 [2024-11-09 10:06:49,408 INFO L226 Difference]: Without dead ends: 717 [2024-11-09 10:06:49,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:06:49,408 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:49,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1865 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:06:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-09 10:06:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-11-09 10:06:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 429 states have (on average 1.7156177156177157) internal successors, (736), 711 states have internal predecessors, (736), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:06:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 762 transitions. [2024-11-09 10:06:49,420 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 762 transitions. Word has length 59 [2024-11-09 10:06:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:49,420 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 762 transitions. [2024-11-09 10:06:49,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:06:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 762 transitions. [2024-11-09 10:06:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 10:06:49,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:49,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:49,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 10:06:49,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:49,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 216241902, now seen corresponding path program 1 times [2024-11-09 10:06:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292597495] [2024-11-09 10:06:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:49,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:49,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:49,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 10:06:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:49,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:06:49,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:49,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:06:49,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292597495] [2024-11-09 10:06:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292597495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:06:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003334929] [2024-11-09 10:06:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:49,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:06:49,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:49,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:06:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:49,876 INFO L87 Difference]: Start difference. First operand 717 states and 762 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:06:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:49,904 INFO L93 Difference]: Finished difference Result 720 states and 766 transitions. [2024-11-09 10:06:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:06:49,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2024-11-09 10:06:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:49,908 INFO L225 Difference]: With dead ends: 720 [2024-11-09 10:06:49,908 INFO L226 Difference]: Without dead ends: 720 [2024-11-09 10:06:49,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:06:49,909 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 0 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:49,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:06:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-09 10:06:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-09 10:06:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 431 states have (on average 1.71461716937355) internal successors, (739), 714 states have internal predecessors, (739), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:06:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 766 transitions. [2024-11-09 10:06:49,922 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 766 transitions. Word has length 67 [2024-11-09 10:06:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:49,922 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 766 transitions. [2024-11-09 10:06:49,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:06:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 766 transitions. [2024-11-09 10:06:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 10:06:49,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:49,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:49,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 10:06:50,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:50,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:50,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -572148029, now seen corresponding path program 1 times [2024-11-09 10:06:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567838579] [2024-11-09 10:06:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:50,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:50,127 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:50,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:06:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:50,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:06:50,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:50,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:50,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567838579] [2024-11-09 10:06:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567838579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:06:50,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:06:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849637146] [2024-11-09 10:06:50,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:06:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:06:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:06:50,459 INFO L87 Difference]: Start difference. First operand 720 states and 766 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:06:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:50,613 INFO L93 Difference]: Finished difference Result 732 states and 783 transitions. [2024-11-09 10:06:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:06:50,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-09 10:06:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:50,616 INFO L225 Difference]: With dead ends: 732 [2024-11-09 10:06:50,617 INFO L226 Difference]: Without dead ends: 732 [2024-11-09 10:06:50,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:06:50,617 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 5 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:50,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2835 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:06:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-09 10:06:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2024-11-09 10:06:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 440 states have (on average 1.7136363636363636) internal successors, (754), 723 states have internal predecessors, (754), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:06:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 781 transitions. [2024-11-09 10:06:50,632 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 781 transitions. Word has length 68 [2024-11-09 10:06:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:50,632 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 781 transitions. [2024-11-09 10:06:50,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:06:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 781 transitions. [2024-11-09 10:06:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 10:06:50,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:50,633 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:50,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:06:50,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:50,834 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:50,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1280795694, now seen corresponding path program 2 times [2024-11-09 10:06:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429179478] [2024-11-09 10:06:50,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:06:50,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:50,836 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:50,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:06:51,166 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:06:51,166 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:06:51,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:06:51,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:51,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:51,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429179478] [2024-11-09 10:06:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429179478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:06:51,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:06:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48521954] [2024-11-09 10:06:51,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:06:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:06:51,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:06:51,430 INFO L87 Difference]: Start difference. First operand 730 states and 781 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:06:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:51,814 INFO L93 Difference]: Finished difference Result 745 states and 802 transitions. [2024-11-09 10:06:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:06:51,814 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-09 10:06:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:51,816 INFO L225 Difference]: With dead ends: 745 [2024-11-09 10:06:51,816 INFO L226 Difference]: Without dead ends: 739 [2024-11-09 10:06:51,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 10:06:51,817 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 14 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:51,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4965 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:06:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-09 10:06:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-11-09 10:06:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 449 states have (on average 1.7037861915367483) internal successors, (765), 732 states have internal predecessors, (765), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:06:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 792 transitions. [2024-11-09 10:06:51,830 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 792 transitions. Word has length 71 [2024-11-09 10:06:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 792 transitions. [2024-11-09 10:06:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:06:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 792 transitions. [2024-11-09 10:06:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:06:51,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:51,831 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:51,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 10:06:52,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:52,032 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1827542002, now seen corresponding path program 3 times [2024-11-09 10:06:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:52,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593233351] [2024-11-09 10:06:52,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:06:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:52,034 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:52,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 10:06:52,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:06:52,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:06:52,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:06:52,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:52,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:53,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:53,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593233351] [2024-11-09 10:06:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593233351] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:06:53,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:53,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:06:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327998087] [2024-11-09 10:06:53,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:53,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:06:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:06:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:06:53,183 INFO L87 Difference]: Start difference. First operand 739 states and 792 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:06:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:54,624 INFO L93 Difference]: Finished difference Result 763 states and 831 transitions. [2024-11-09 10:06:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:06:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 77 [2024-11-09 10:06:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:54,628 INFO L225 Difference]: With dead ends: 763 [2024-11-09 10:06:54,628 INFO L226 Difference]: Without dead ends: 757 [2024-11-09 10:06:54,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 10:06:54,629 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 23 mSDsluCounter, 8507 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9219 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:54,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9219 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:06:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-09 10:06:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2024-11-09 10:06:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 467 states have (on average 1.6873661670235547) internal successors, (788), 750 states have internal predecessors, (788), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:06:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 815 transitions. [2024-11-09 10:06:54,645 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 815 transitions. Word has length 77 [2024-11-09 10:06:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:54,645 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 815 transitions. [2024-11-09 10:06:54,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:06:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 815 transitions. [2024-11-09 10:06:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:06:54,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:54,647 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:06:54,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-09 10:06:54,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:54,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:06:54,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -473119794, now seen corresponding path program 4 times [2024-11-09 10:06:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:06:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851656637] [2024-11-09 10:06:54,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:06:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:06:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:06:54,852 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:06:54,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 10:06:55,282 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:06:55,282 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:06:55,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:06:55,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:55,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:56,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:06:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851656637] [2024-11-09 10:06:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851656637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:06:56,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:56,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:06:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060231105] [2024-11-09 10:06:56,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:56,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:06:56,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:06:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:06:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:06:56,844 INFO L87 Difference]: Start difference. First operand 757 states and 815 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:07:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:07:01,659 INFO L93 Difference]: Finished difference Result 797 states and 887 transitions. [2024-11-09 10:07:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:07:01,660 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89 [2024-11-09 10:07:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:07:01,664 INFO L225 Difference]: With dead ends: 797 [2024-11-09 10:07:01,664 INFO L226 Difference]: Without dead ends: 793 [2024-11-09 10:07:01,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:07:01,667 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 34 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16998 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:07:01,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16998 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:07:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-09 10:07:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2024-11-09 10:07:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 501 states have (on average 1.6646706586826348) internal successors, (834), 784 states have internal predecessors, (834), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 10:07:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 861 transitions. [2024-11-09 10:07:01,686 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 861 transitions. Word has length 89 [2024-11-09 10:07:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:07:01,686 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 861 transitions. [2024-11-09 10:07:01,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:07:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 861 transitions. [2024-11-09 10:07:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 10:07:01,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:07:01,688 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:07:01,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 10:07:01,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:07:01,889 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-09 10:07:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:07:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 666044590, now seen corresponding path program 5 times [2024-11-09 10:07:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:07:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045097965] [2024-11-09 10:07:01,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:07:01,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:07:01,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:07:01,894 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:07:01,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 10:07:03,065 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:07:03,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:07:03,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 10:07:03,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:07:03,115 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 10:07:03,115 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-11-09 10:07:03,432 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 10:07:03,432 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-11-09 10:07:03,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:07:03,635 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-11-09 10:07:06,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:07:06,359 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-11-09 10:07:06,466 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-11-09 10:07:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 10:07:06,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:07:06,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 10:07:06,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:07:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045097965] [2024-11-09 10:07:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045097965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:07:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1089874256] [2024-11-09 10:07:06,937 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:07:06,937 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:07:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:07:06,938 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:07:06,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process