./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:19:25,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:19:25,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:19:25,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:19:25,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:19:25,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:19:25,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:19:25,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:19:25,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:19:25,357 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:19:25,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:19:25,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:19:25,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:19:25,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:19:25,361 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:19:25,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:19:25,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:19:25,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:19:25,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:19:25,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:19:25,367 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:19:25,367 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:19:25,367 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:19:25,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:19:25,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:19:25,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:19:25,368 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:19:25,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:19:25,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:19:25,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:19:25,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:19:25,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:19:25,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:19:25,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:19:25,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:19:25,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:19:25,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:19:25,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:19:25,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:19:25,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:19:25,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:19:25,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:19:25,374 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-clean/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-clean/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-10-11 19:19:25,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:19:25,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:19:25,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:19:25,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:19:25,656 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:19:25,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2024-10-11 19:19:27,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:19:27,447 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:19:27,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2024-10-11 19:19:27,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32182ff04/0cbfc717506c4da38f0d37ba45e1cfd8/FLAG014f59f4f [2024-10-11 19:19:27,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32182ff04/0cbfc717506c4da38f0d37ba45e1cfd8 [2024-10-11 19:19:27,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:19:27,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:19:27,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:19:27,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:19:27,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:19:27,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:19:27" (1/1) ... [2024-10-11 19:19:27,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c497c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:27, skipping insertion in model container [2024-10-11 19:19:27,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:19:27" (1/1) ... [2024-10-11 19:19:27,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:19:28,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:19:28,166 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 19:19:28,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23bd55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:28, skipping insertion in model container [2024-10-11 19:19:28,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:19:28,168 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:19:28,170 INFO L158 Benchmark]: Toolchain (without parser) took 671.50ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 68.8MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 19:19:28,171 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:19:28,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.68ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 68.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 19:19:28,173 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.30ms. Allocated memory is still 142.6MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.68ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 68.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:19:30,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:19:30,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:19:30,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:19:30,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:19:30,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:19:30,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:19:30,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:19:30,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:19:30,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:19:30,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:19:30,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:19:30,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:19:30,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:19:30,470 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:19:30,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:19:30,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:19:30,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:19:30,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:19:30,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:19:30,472 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:19:30,476 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:19:30,476 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:19:30,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:19:30,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:19:30,477 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:19:30,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:19:30,477 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:19:30,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:19:30,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:19:30,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:19:30,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:19:30,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:19:30,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:19:30,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:19:30,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:19:30,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:19:30,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:19:30,487 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:19:30,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:19:30,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:19:30,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:19:30,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:19:30,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:19:30,489 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:19:30,489 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-clean/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-clean/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-10-11 19:19:30,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:19:30,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:19:30,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:19:30,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:19:30,860 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:19:30,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2024-10-11 19:19:32,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:19:32,807 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:19:32,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2024-10-11 19:19:32,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b0ea4b4f/2c396ebc23d0499d979df7fd47d5defb/FLAG8f470b2b3 [2024-10-11 19:19:33,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b0ea4b4f/2c396ebc23d0499d979df7fd47d5defb [2024-10-11 19:19:33,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:19:33,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:19:33,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:19:33,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:19:33,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:19:33,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:33,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4cf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33, skipping insertion in model container [2024-10-11 19:19:33,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:33,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:19:33,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:19:33,730 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:19:33,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:19:33,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:19:33,842 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:19:33,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:19:33,978 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:19:33,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33 WrapperNode [2024-10-11 19:19:33,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:19:33,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:19:33,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:19:33,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:19:33,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,077 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 762 [2024-10-11 19:19:34,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:19:34,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:19:34,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:19:34,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:19:34,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,197 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-10-11 19:19:34,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:19:34,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:19:34,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:19:34,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:19:34,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (1/1) ... [2024-10-11 19:19:34,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:19:34,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:19:34,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:19:34,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:19:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:19:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:19:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:19:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:19:34,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:19:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:19:34,361 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:19:34,361 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:19:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:19:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:19:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:19:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:19:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:19:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:19:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:19:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:19:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:19:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:19:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:19:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:19:34,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:19:34,575 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:19:34,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:19:34,582 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:19:34,662 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:19:37,722 INFO L? ?]: Removed 894 outVars from TransFormulas that were not future-live. [2024-10-11 19:19:37,723 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:19:37,855 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:19:37,857 INFO L314 CfgBuilder]: Removed 40 assume(true) statements. [2024-10-11 19:19:37,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:19:37 BoogieIcfgContainer [2024-10-11 19:19:37,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:19:37,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:19:37,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:19:37,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:19:37,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:19:33" (1/3) ... [2024-10-11 19:19:37,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f75d833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:19:37, skipping insertion in model container [2024-10-11 19:19:37,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:19:33" (2/3) ... [2024-10-11 19:19:37,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f75d833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:19:37, skipping insertion in model container [2024-10-11 19:19:37,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:19:37" (3/3) ... [2024-10-11 19:19:37,866 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-2.i [2024-10-11 19:19:37,881 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:19:37,882 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-10-11 19:19:37,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:19:37,964 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;@8d16113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:19:37,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-10-11 19:19:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 753 states, 326 states have (on average 2.549079754601227) internal successors, (831), 748 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:19:37,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:37,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:19:37,978 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-10-11 19:19:37,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash 38547730, now seen corresponding path program 1 times [2024-10-11 19:19:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68247936] [2024-10-11 19:19:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:37,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:37,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:38,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:38,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 19:19:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:38,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:38,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:38,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:38,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:38,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68247936] [2024-10-11 19:19:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68247936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:38,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993087840] [2024-10-11 19:19:38,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:38,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:38,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:38,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:38,297 INFO L87 Difference]: Start difference. First operand has 753 states, 326 states have (on average 2.549079754601227) internal successors, (831), 748 states have internal predecessors, (831), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:39,737 INFO L93 Difference]: Finished difference Result 696 states and 735 transitions. [2024-10-11 19:19:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 19:19:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:39,755 INFO L225 Difference]: With dead ends: 696 [2024-10-11 19:19:39,755 INFO L226 Difference]: Without dead ends: 695 [2024-10-11 19:19:39,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:39,760 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 455 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:39,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 496 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:19:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-11 19:19:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2024-10-11 19:19:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 321 states have (on average 2.2585669781931466) internal successors, (725), 688 states have internal predecessors, (725), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 731 transitions. [2024-10-11 19:19:39,825 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 731 transitions. Word has length 4 [2024-10-11 19:19:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:39,826 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 731 transitions. [2024-10-11 19:19:39,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 731 transitions. [2024-10-11 19:19:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 19:19:39,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:39,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 19:19:39,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:40,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:40,028 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-10-11 19:19:40,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 38547731, now seen corresponding path program 1 times [2024-10-11 19:19:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115304386] [2024-10-11 19:19:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:40,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:40,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:40,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 19:19:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:40,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:40,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:40,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:40,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:40,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115304386] [2024-10-11 19:19:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115304386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135951185] [2024-10-11 19:19:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:40,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:40,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:40,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:40,177 INFO L87 Difference]: Start difference. First operand 693 states and 731 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:41,772 INFO L93 Difference]: Finished difference Result 756 states and 798 transitions. [2024-10-11 19:19:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 19:19:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:41,776 INFO L225 Difference]: With dead ends: 756 [2024-10-11 19:19:41,776 INFO L226 Difference]: Without dead ends: 756 [2024-10-11 19:19:41,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:41,778 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 235 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:41,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 774 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:19:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-11 19:19:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 709. [2024-10-11 19:19:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 348 states have (on average 2.235632183908046) internal successors, (778), 704 states have internal predecessors, (778), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 784 transitions. [2024-10-11 19:19:41,815 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 784 transitions. Word has length 4 [2024-10-11 19:19:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:41,815 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 784 transitions. [2024-10-11 19:19:41,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 784 transitions. [2024-10-11 19:19:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 19:19:41,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:41,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 19:19:41,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:19:42,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:42,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:42,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1195792100, now seen corresponding path program 1 times [2024-10-11 19:19:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314235144] [2024-10-11 19:19:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:42,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:42,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 19:19:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:42,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:19:42,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:42,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:42,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314235144] [2024-10-11 19:19:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314235144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848570984] [2024-10-11 19:19:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:42,131 INFO L87 Difference]: Start difference. First operand 709 states and 784 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:42,858 INFO L93 Difference]: Finished difference Result 1216 states and 1354 transitions. [2024-10-11 19:19:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:42,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 19:19:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:42,865 INFO L225 Difference]: With dead ends: 1216 [2024-10-11 19:19:42,865 INFO L226 Difference]: Without dead ends: 1216 [2024-10-11 19:19:42,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:42,869 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 499 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:42,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1444 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:19:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-10-11 19:19:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 710. [2024-10-11 19:19:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 349 states have (on average 2.232091690544413) internal successors, (779), 705 states have internal predecessors, (779), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 785 transitions. [2024-10-11 19:19:42,899 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 785 transitions. Word has length 5 [2024-10-11 19:19:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:42,899 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 785 transitions. [2024-10-11 19:19:42,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 785 transitions. [2024-10-11 19:19:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:19:42,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:42,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:42,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:43,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:43,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:43,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash -31267943, now seen corresponding path program 1 times [2024-10-11 19:19:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893000756] [2024-10-11 19:19:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:43,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:43,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:43,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:43,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 19:19:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:43,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:19:43,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:43,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:43,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893000756] [2024-10-11 19:19:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893000756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:43,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:43,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388376997] [2024-10-11 19:19:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:43,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:43,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:43,231 INFO L87 Difference]: Start difference. First operand 710 states and 785 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:43,721 INFO L93 Difference]: Finished difference Result 671 states and 745 transitions. [2024-10-11 19:19:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:43,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 19:19:43,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:43,724 INFO L225 Difference]: With dead ends: 671 [2024-10-11 19:19:43,724 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 19:19:43,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:43,726 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 61 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:43,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1134 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:19:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 19:19:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-10-11 19:19:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 334 states have (on average 2.212574850299401) internal successors, (739), 666 states have internal predecessors, (739), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 745 transitions. [2024-10-11 19:19:43,749 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 745 transitions. Word has length 11 [2024-10-11 19:19:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:43,749 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 745 transitions. [2024-10-11 19:19:43,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 745 transitions. [2024-10-11 19:19:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:19:43,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:43,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:43,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:43,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash 16274164, now seen corresponding path program 1 times [2024-10-11 19:19:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290012130] [2024-10-11 19:19:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:43,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:43,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:43,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:43,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 19:19:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:44,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:44,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:44,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:44,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290012130] [2024-10-11 19:19:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290012130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:44,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625285612] [2024-10-11 19:19:44,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:44,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:44,107 INFO L87 Difference]: Start difference. First operand 671 states and 745 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:44,734 INFO L93 Difference]: Finished difference Result 656 states and 723 transitions. [2024-10-11 19:19:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:19:44,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 19:19:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:44,738 INFO L225 Difference]: With dead ends: 656 [2024-10-11 19:19:44,738 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 19:19:44,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:44,740 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 45 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:44,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1653 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:19:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 19:19:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2024-10-11 19:19:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 333 states have (on average 2.1531531531531534) internal successors, (717), 651 states have internal predecessors, (717), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 723 transitions. [2024-10-11 19:19:44,753 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 723 transitions. Word has length 13 [2024-10-11 19:19:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:44,754 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 723 transitions. [2024-10-11 19:19:44,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 723 transitions. [2024-10-11 19:19:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 19:19:44,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:44,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:44,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 19:19:44,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:44,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1697104799, now seen corresponding path program 1 times [2024-10-11 19:19:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984791678] [2024-10-11 19:19:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:44,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:44,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 19:19:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:45,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:45,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:45,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:45,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984791678] [2024-10-11 19:19:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984791678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:45,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497155810] [2024-10-11 19:19:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:45,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:45,161 INFO L87 Difference]: Start difference. First operand 656 states and 723 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:46,771 INFO L93 Difference]: Finished difference Result 656 states and 723 transitions. [2024-10-11 19:19:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 19:19:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:46,775 INFO L225 Difference]: With dead ends: 656 [2024-10-11 19:19:46,776 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 19:19:46,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:46,779 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 398 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:46,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 702 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:19:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 19:19:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2024-10-11 19:19:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 333 states have (on average 2.141141141141141) internal successors, (713), 647 states have internal predecessors, (713), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 719 transitions. [2024-10-11 19:19:46,793 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 719 transitions. Word has length 27 [2024-10-11 19:19:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:46,794 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 719 transitions. [2024-10-11 19:19:46,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 719 transitions. [2024-10-11 19:19:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 19:19:46,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:46,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:46,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 19:19:46,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:46,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1697104798, now seen corresponding path program 1 times [2024-10-11 19:19:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376248040] [2024-10-11 19:19:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:47,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:47,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 19:19:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:47,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:19:47,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:47,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:47,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:47,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376248040] [2024-10-11 19:19:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376248040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:47,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:47,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:47,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337405805] [2024-10-11 19:19:47,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:47,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:47,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:47,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:47,354 INFO L87 Difference]: Start difference. First operand 652 states and 719 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:48,979 INFO L93 Difference]: Finished difference Result 699 states and 733 transitions. [2024-10-11 19:19:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 19:19:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:48,983 INFO L225 Difference]: With dead ends: 699 [2024-10-11 19:19:48,983 INFO L226 Difference]: Without dead ends: 699 [2024-10-11 19:19:48,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:48,984 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 174 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:48,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 996 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 19:19:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-11 19:19:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 648. [2024-10-11 19:19:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 333 states have (on average 2.129129129129129) internal successors, (709), 643 states have internal predecessors, (709), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 715 transitions. [2024-10-11 19:19:48,998 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 715 transitions. Word has length 27 [2024-10-11 19:19:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:48,999 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 715 transitions. [2024-10-11 19:19:49,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 715 transitions. [2024-10-11 19:19:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 19:19:49,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:49,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:49,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:19:49,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:49,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:49,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2141839909, now seen corresponding path program 1 times [2024-10-11 19:19:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:49,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319635341] [2024-10-11 19:19:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:49,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:49,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:49,208 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:49,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 19:19:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:49,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:49,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:49,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:49,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319635341] [2024-10-11 19:19:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319635341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108666896] [2024-10-11 19:19:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:49,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:49,434 INFO L87 Difference]: Start difference. First operand 648 states and 715 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:50,007 INFO L93 Difference]: Finished difference Result 642 states and 705 transitions. [2024-10-11 19:19:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:19:50,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-11 19:19:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:50,011 INFO L225 Difference]: With dead ends: 642 [2024-10-11 19:19:50,011 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 19:19:50,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:50,012 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 15 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:50,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1636 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:19:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 19:19:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-10-11 19:19:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 327 states have (on average 2.1376146788990824) internal successors, (699), 637 states have internal predecessors, (699), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 705 transitions. [2024-10-11 19:19:50,025 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 705 transitions. Word has length 43 [2024-10-11 19:19:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:50,026 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 705 transitions. [2024-10-11 19:19:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 705 transitions. [2024-10-11 19:19:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 19:19:50,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:50,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:50,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 19:19:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:50,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1994884924, now seen corresponding path program 1 times [2024-10-11 19:19:50,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:50,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847722837] [2024-10-11 19:19:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:50,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:50,230 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:50,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 19:19:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:50,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:50,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:50,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:50,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847722837] [2024-10-11 19:19:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847722837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:50,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:19:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998825792] [2024-10-11 19:19:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:19:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:19:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:50,681 INFO L87 Difference]: Start difference. First operand 642 states and 705 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:51,405 INFO L93 Difference]: Finished difference Result 840 states and 932 transitions. [2024-10-11 19:19:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:19:51,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 19:19:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:51,409 INFO L225 Difference]: With dead ends: 840 [2024-10-11 19:19:51,409 INFO L226 Difference]: Without dead ends: 840 [2024-10-11 19:19:51,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:19:51,410 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 161 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:51,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1121 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:19:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-10-11 19:19:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 686. [2024-10-11 19:19:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 371 states have (on average 2.0026954177897576) internal successors, (743), 681 states have internal predecessors, (743), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 749 transitions. [2024-10-11 19:19:51,423 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 749 transitions. Word has length 47 [2024-10-11 19:19:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:51,424 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 749 transitions. [2024-10-11 19:19:51,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 749 transitions. [2024-10-11 19:19:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 19:19:51,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:51,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:51,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:19:51,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:51,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:51,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 46829257, now seen corresponding path program 1 times [2024-10-11 19:19:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:51,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149833376] [2024-10-11 19:19:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:51,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:51,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:51,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:51,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:19:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:51,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:19:51,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:51,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:51,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:52,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:19:52,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 19:19:52,415 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:19:52,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:19:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:52,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:52,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149833376] [2024-10-11 19:19:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149833376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:19:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728187771] [2024-10-11 19:19:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:52,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:52,434 INFO L87 Difference]: Start difference. First operand 686 states and 749 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:53,490 INFO L93 Difference]: Finished difference Result 648 states and 711 transitions. [2024-10-11 19:19:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 19:19:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:53,494 INFO L225 Difference]: With dead ends: 648 [2024-10-11 19:19:53,494 INFO L226 Difference]: Without dead ends: 648 [2024-10-11 19:19:53,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:53,495 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 662 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:53,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 375 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 19:19:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-11 19:19:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 621. [2024-10-11 19:19:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 344 states have (on average 1.8633720930232558) internal successors, (641), 616 states have internal predecessors, (641), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 647 transitions. [2024-10-11 19:19:53,508 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 647 transitions. Word has length 50 [2024-10-11 19:19:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:53,509 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 647 transitions. [2024-10-11 19:19:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 647 transitions. [2024-10-11 19:19:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:19:53,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:53,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:53,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:19:53,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:53,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:53,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1600429972, now seen corresponding path program 1 times [2024-10-11 19:19:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844593967] [2024-10-11 19:19:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:53,717 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:53,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 19:19:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:53,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:19:53,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:53,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:19:53,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:19:53,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 19:19:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:53,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:53,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844593967] [2024-10-11 19:19:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844593967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306196775] [2024-10-11 19:19:53,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:53,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:19:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:19:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:53,954 INFO L87 Difference]: Start difference. First operand 621 states and 647 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:55,392 INFO L93 Difference]: Finished difference Result 620 states and 646 transitions. [2024-10-11 19:19:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:19:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 19:19:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:55,398 INFO L225 Difference]: With dead ends: 620 [2024-10-11 19:19:55,398 INFO L226 Difference]: Without dead ends: 620 [2024-10-11 19:19:55,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:19:55,400 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:55,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1325 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:19:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-10-11 19:19:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2024-10-11 19:19:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 344 states have (on average 1.8604651162790697) internal successors, (640), 615 states have internal predecessors, (640), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 646 transitions. [2024-10-11 19:19:55,410 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 646 transitions. Word has length 54 [2024-10-11 19:19:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:55,411 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 646 transitions. [2024-10-11 19:19:55,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 646 transitions. [2024-10-11 19:19:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:19:55,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:55,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:55,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 19:19:55,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:55,614 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:55,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:55,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1600429971, now seen corresponding path program 1 times [2024-10-11 19:19:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743607838] [2024-10-11 19:19:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:55,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:55,616 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:55,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 19:19:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:55,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:19:55,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:55,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:19:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 19:19:55,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:19:55,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 19:19:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:55,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:55,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:55,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743607838] [2024-10-11 19:19:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743607838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741899064] [2024-10-11 19:19:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:55,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:19:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:19:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:19:55,901 INFO L87 Difference]: Start difference. First operand 620 states and 646 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:58,049 INFO L93 Difference]: Finished difference Result 619 states and 645 transitions. [2024-10-11 19:19:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:19:58,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 19:19:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:58,053 INFO L225 Difference]: With dead ends: 619 [2024-10-11 19:19:58,054 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 19:19:58,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:19:58,055 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 1 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:58,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1348 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 19:19:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 19:19:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2024-10-11 19:19:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 343 states have (on average 1.8629737609329446) internal successors, (639), 614 states have internal predecessors, (639), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 19:19:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 645 transitions. [2024-10-11 19:19:58,067 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 645 transitions. Word has length 54 [2024-10-11 19:19:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:58,068 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 645 transitions. [2024-10-11 19:19:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:19:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 645 transitions. [2024-10-11 19:19:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 19:19:58,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:58,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:58,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 19:19:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:58,270 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 284761873, now seen corresponding path program 1 times [2024-10-11 19:19:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311891919] [2024-10-11 19:19:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:58,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:58,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 19:19:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:58,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:19:58,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:58,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:19:58,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:58,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311891919] [2024-10-11 19:19:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311891919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:19:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:19:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:19:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193524428] [2024-10-11 19:19:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:19:58,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:19:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:19:58,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:58,533 INFO L87 Difference]: Start difference. First operand 619 states and 645 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:19:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:19:59,050 INFO L93 Difference]: Finished difference Result 621 states and 648 transitions. [2024-10-11 19:19:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:19:59,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2024-10-11 19:19:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:19:59,054 INFO L225 Difference]: With dead ends: 621 [2024-10-11 19:19:59,055 INFO L226 Difference]: Without dead ends: 621 [2024-10-11 19:19:59,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:19:59,055 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:19:59,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1572 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:19:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-11 19:19:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2024-10-11 19:19:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 344 states have (on average 1.8633720930232558) internal successors, (641), 616 states have internal predecessors, (641), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:19:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 648 transitions. [2024-10-11 19:19:59,066 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 648 transitions. Word has length 60 [2024-10-11 19:19:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:19:59,066 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 648 transitions. [2024-10-11 19:19:59,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 19:19:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 648 transitions. [2024-10-11 19:19:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 19:19:59,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:19:59,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:19:59,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 19:19:59,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:59,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:19:59,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:19:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1242313806, now seen corresponding path program 1 times [2024-10-11 19:19:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:19:59,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197278455] [2024-10-11 19:19:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:19:59,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:19:59,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:19:59,271 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:19:59,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 19:19:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:19:59,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:19:59,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:19:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:59,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:19:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:19:59,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:19:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197278455] [2024-10-11 19:19:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197278455] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:19:59,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:19:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:19:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022834239] [2024-10-11 19:19:59,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:19:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:19:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:19:59,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:19:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:19:59,589 INFO L87 Difference]: Start difference. First operand 621 states and 648 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:20:00,418 INFO L93 Difference]: Finished difference Result 630 states and 662 transitions. [2024-10-11 19:20:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:20:00,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2024-10-11 19:20:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:20:00,421 INFO L225 Difference]: With dead ends: 630 [2024-10-11 19:20:00,422 INFO L226 Difference]: Without dead ends: 630 [2024-10-11 19:20:00,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:20:00,422 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 5 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:20:00,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2092 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:20:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-10-11 19:20:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 629. [2024-10-11 19:20:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 351 states have (on average 1.8632478632478633) internal successors, (654), 623 states have internal predecessors, (654), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:20:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 661 transitions. [2024-10-11 19:20:00,436 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 661 transitions. Word has length 61 [2024-10-11 19:20:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:20:00,437 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 661 transitions. [2024-10-11 19:20:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 661 transitions. [2024-10-11 19:20:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:20:00,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:00,438 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:20:00,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 19:20:00,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:00,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:20:00,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash -795885743, now seen corresponding path program 2 times [2024-10-11 19:20:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389120732] [2024-10-11 19:20:00,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:20:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:00,643 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:20:00,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 19:20:00,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:20:00,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:20:01,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:20:01,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:01,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:20:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:01,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389120732] [2024-10-11 19:20:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389120732] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:20:01,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:20:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:20:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208688033] [2024-10-11 19:20:01,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:20:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:20:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:20:01,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:20:01,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:20:01,179 INFO L87 Difference]: Start difference. First operand 629 states and 661 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:20:02,477 INFO L93 Difference]: Finished difference Result 641 states and 680 transitions. [2024-10-11 19:20:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:20:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2024-10-11 19:20:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:20:02,483 INFO L225 Difference]: With dead ends: 641 [2024-10-11 19:20:02,483 INFO L226 Difference]: Without dead ends: 639 [2024-10-11 19:20:02,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:20:02,484 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 8 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:20:02,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3139 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:20:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-11 19:20:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 638. [2024-10-11 19:20:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 360 states have (on average 1.85) internal successors, (666), 632 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:20:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 673 transitions. [2024-10-11 19:20:02,496 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 673 transitions. Word has length 64 [2024-10-11 19:20:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:20:02,497 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 673 transitions. [2024-10-11 19:20:02,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 673 transitions. [2024-10-11 19:20:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 19:20:02,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:02,498 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:20:02,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 19:20:02,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:02,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:20:02,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash 980136881, now seen corresponding path program 3 times [2024-10-11 19:20:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61082749] [2024-10-11 19:20:02,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:20:02,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:02,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:02,703 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:20:02,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 19:20:03,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:20:03,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:20:03,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:20:03,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:03,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:20:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:04,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:04,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61082749] [2024-10-11 19:20:04,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61082749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:20:04,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:20:04,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:20:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585956555] [2024-10-11 19:20:04,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:20:04,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:20:04,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:20:04,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:20:04,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:20:04,063 INFO L87 Difference]: Start difference. First operand 638 states and 673 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:20:07,346 INFO L93 Difference]: Finished difference Result 659 states and 709 transitions. [2024-10-11 19:20:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:20:07,346 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-10-11 19:20:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:20:07,349 INFO L225 Difference]: With dead ends: 659 [2024-10-11 19:20:07,349 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 19:20:07,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:20:07,350 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 14 mSDsluCounter, 5751 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6275 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:20:07,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6275 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:20:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 19:20:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2024-10-11 19:20:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 378 states have (on average 1.8227513227513228) internal successors, (689), 650 states have internal predecessors, (689), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:20:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 696 transitions. [2024-10-11 19:20:07,364 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 696 transitions. Word has length 70 [2024-10-11 19:20:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:20:07,365 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 696 transitions. [2024-10-11 19:20:07,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 696 transitions. [2024-10-11 19:20:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 19:20:07,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:07,366 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:20:07,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:20:07,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:07,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:20:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1484307343, now seen corresponding path program 4 times [2024-10-11 19:20:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213597043] [2024-10-11 19:20:07,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:20:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:07,573 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:20:07,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 19:20:08,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:20:08,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:20:08,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:20:08,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:08,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:20:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:20:09,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213597043] [2024-10-11 19:20:09,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213597043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:20:09,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:20:09,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:20:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25340614] [2024-10-11 19:20:09,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:20:09,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:20:09,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:20:09,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:20:09,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:20:09,600 INFO L87 Difference]: Start difference. First operand 656 states and 696 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:20:17,417 INFO L93 Difference]: Finished difference Result 693 states and 765 transitions. [2024-10-11 19:20:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:20:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-10-11 19:20:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:20:17,421 INFO L225 Difference]: With dead ends: 693 [2024-10-11 19:20:17,422 INFO L226 Difference]: Without dead ends: 691 [2024-10-11 19:20:17,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:20:17,424 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 26 mSDsluCounter, 12029 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12553 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:20:17,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12553 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 19:20:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-11 19:20:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 690. [2024-10-11 19:20:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 412 states have (on average 1.7839805825242718) internal successors, (735), 684 states have internal predecessors, (735), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 19:20:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 742 transitions. [2024-10-11 19:20:17,435 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 742 transitions. Word has length 82 [2024-10-11 19:20:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:20:17,435 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 742 transitions. [2024-10-11 19:20:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 19:20:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 742 transitions. [2024-10-11 19:20:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 19:20:17,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:20:17,437 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:20:17,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:20:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:17,638 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-11 19:20:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:20:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1118494255, now seen corresponding path program 5 times [2024-10-11 19:20:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:20:17,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095617098] [2024-10-11 19:20:17,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:20:17,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:20:17,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:20:17,640 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 19:20:17,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 19:20:18,854 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:20:18,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:20:18,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-11 19:20:18,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:20:18,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:20:19,075 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:20:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 19:20:19,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-11 19:20:19,112 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 11 treesize of output 7 [2024-10-11 19:20:19,121 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 15 treesize of output 1 [2024-10-11 19:20:19,215 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 18 treesize of output 10 [2024-10-11 19:20:19,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 19:20:20,056 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 19:20:20,056 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 50 treesize of output 45 [2024-10-11 19:20:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 11 [2024-10-11 19:20:20,112 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 25 treesize of output 13 [2024-10-11 19:20:20,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 19:20:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-11 19:20:20,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:20:21,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_1739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1738 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-10-11 19:20:21,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:20:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095617098] [2024-10-11 19:20:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095617098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:20:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1824904444] [2024-10-11 19:20:21,203 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:20:21,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:20:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:20:21,206 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:20:21,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process