./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:44:27,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:44:27,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:44:27,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:44:27,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:44:27,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:44:27,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:44:27,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:44:27,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:44:27,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:44:27,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:44:27,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:44:27,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:44:27,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:44:27,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:44:27,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:44:27,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:44:27,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:44:27,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:44:27,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:44:27,450 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:44:27,450 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:44:27,450 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:44:27,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:44:27,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:44:27,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:44:27,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:44:27,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:44:27,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:44:27,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:44:27,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:44:27,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:44:27,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:44:27,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:44:27,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:44:27,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:44:27,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:44:27,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:44:27,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:44:27,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:44:27,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:44:27,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:44:27,457 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-13 11:44:27,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:44:27,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:44:27,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:44:27,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:44:27,754 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:44:27,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-10-13 11:44:29,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:44:29,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:44:29,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-10-13 11:44:29,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97021279b/8c734e3ac4924666b6d039cacabb7ef7/FLAGeaf5c96f9 [2024-10-13 11:44:29,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97021279b/8c734e3ac4924666b6d039cacabb7ef7 [2024-10-13 11:44:29,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:44:29,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:44:29,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:29,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:44:29,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:44:29,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:29" (1/1) ... [2024-10-13 11:44:29,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17bfd32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:29, skipping insertion in model container [2024-10-13 11:44:29,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:29" (1/1) ... [2024-10-13 11:44:29,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:44:30,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:30,242 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 11:44:30,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@609062e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:30, skipping insertion in model container [2024-10-13 11:44:30,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:30,243 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:44:30,246 INFO L158 Benchmark]: Toolchain (without parser) took 674.35ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 85.2MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 11:44:30,246 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:44:30,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.36ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 85.2MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 11:44:30,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.36ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 85.2MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 817]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:44:32,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:44:32,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:44:32,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:44:32,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:44:32,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:44:32,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:44:32,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:44:32,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:44:32,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:44:32,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:44:32,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:44:32,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:44:32,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:44:32,405 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:44:32,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:44:32,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:44:32,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:44:32,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:44:32,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:44:32,406 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:44:32,407 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:44:32,407 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:44:32,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:44:32,408 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:44:32,408 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:44:32,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:44:32,408 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:44:32,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:44:32,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:44:32,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:44:32,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:44:32,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:44:32,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:44:32,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:44:32,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:44:32,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:44:32,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:44:32,411 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:44:32,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:44:32,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:44:32,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:44:32,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:44:32,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:44:32,413 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:44:32,413 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-13 11:44:32,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:44:32,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:44:32,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:44:32,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:44:32,747 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:44:32,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-10-13 11:44:34,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:44:34,730 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:44:34,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-10-13 11:44:34,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324bb17ee/c3a1d4e1fa214b3dade2366dd6d8e094/FLAG35e55477f [2024-10-13 11:44:34,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324bb17ee/c3a1d4e1fa214b3dade2366dd6d8e094 [2024-10-13 11:44:34,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:44:34,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:44:34,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:34,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:44:34,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:44:34,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:34" (1/1) ... [2024-10-13 11:44:34,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4184aeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:34, skipping insertion in model container [2024-10-13 11:44:34,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:44:34" (1/1) ... [2024-10-13 11:44:34,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:44:35,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:35,435 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:44:35,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:44:35,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:35,597 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:44:35,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:44:35,736 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:44:35,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35 WrapperNode [2024-10-13 11:44:35,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:44:35,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:44:35,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:44:35,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:44:35,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,859 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1059 [2024-10-13 11:44:35,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:44:35,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:44:35,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:44:35,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:44:35,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,955 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-13 11:44:35,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:35,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:36,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:36,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:36,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:44:36,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:44:36,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:44:36,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:44:36,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (1/1) ... [2024-10-13 11:44:36,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:44:36,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:44:36,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:44:36,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:44:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:44:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:44:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:44:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:44:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:44:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:44:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:44:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:44:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:44:36,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:44:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:44:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:44:36,328 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:44:36,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:44:36,333 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:44:36,387 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:44:36,413 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:44:40,074 INFO L? ?]: Removed 1087 outVars from TransFormulas that were not future-live. [2024-10-13 11:44:40,075 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:44:40,256 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:44:40,256 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 11:44:40,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:40 BoogieIcfgContainer [2024-10-13 11:44:40,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:44:40,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:44:40,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:44:40,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:44:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:44:34" (1/3) ... [2024-10-13 11:44:40,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbb1eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:44:40, skipping insertion in model container [2024-10-13 11:44:40,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:44:35" (2/3) ... [2024-10-13 11:44:40,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbb1eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:44:40, skipping insertion in model container [2024-10-13 11:44:40,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:44:40" (3/3) ... [2024-10-13 11:44:40,269 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-2.i [2024-10-13 11:44:40,286 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:44:40,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-10-13 11:44:40,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:44:40,371 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;@299ea2a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:44:40,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-10-13 11:44:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 957 states, 430 states have (on average 2.5069767441860464) internal successors, (1078), 952 states have internal predecessors, (1078), 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-13 11:44:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:44:40,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:40,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:44:40,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1670016, now seen corresponding path program 1 times [2024-10-13 11:44:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060325496] [2024-10-13 11:44:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:40,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:40,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:40,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:44:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:40,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:44:40,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:40,649 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-13 11:44:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:40,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:40,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060325496] [2024-10-13 11:44:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060325496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:40,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:40,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:40,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132153443] [2024-10-13 11:44:40,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:40,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:40,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:44:40,695 INFO L87 Difference]: Start difference. First operand has 957 states, 430 states have (on average 2.5069767441860464) internal successors, (1078), 952 states have internal predecessors, (1078), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:42,683 INFO L93 Difference]: Finished difference Result 1309 states and 1410 transitions. [2024-10-13 11:44:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 11:44:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:42,703 INFO L225 Difference]: With dead ends: 1309 [2024-10-13 11:44:42,704 INFO L226 Difference]: Without dead ends: 1307 [2024-10-13 11:44:42,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:44:42,708 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 390 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:42,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1212 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 1411 Unchecked, 1.9s Time] [2024-10-13 11:44:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2024-10-13 11:44:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 946. [2024-10-13 11:44:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 425 states have (on average 2.3458823529411763) internal successors, (997), 941 states have internal predecessors, (997), 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-13 11:44:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1003 transitions. [2024-10-13 11:44:42,808 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1003 transitions. Word has length 3 [2024-10-13 11:44:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1003 transitions. [2024-10-13 11:44:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1003 transitions. [2024-10-13 11:44:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:44:42,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:42,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:44:42,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:44:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:43,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1668425, now seen corresponding path program 1 times [2024-10-13 11:44:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106384115] [2024-10-13 11:44:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:43,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:43,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:43,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:43,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:44:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:43,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:43,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:43,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:44:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:43,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:43,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106384115] [2024-10-13 11:44:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106384115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:44:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055927214] [2024-10-13 11:44:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:43,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:43,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:43,192 INFO L87 Difference]: Start difference. First operand 946 states and 1003 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:44,771 INFO L93 Difference]: Finished difference Result 1107 states and 1174 transitions. [2024-10-13 11:44:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:44,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 11:44:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:44,776 INFO L225 Difference]: With dead ends: 1107 [2024-10-13 11:44:44,776 INFO L226 Difference]: Without dead ends: 1107 [2024-10-13 11:44:44,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:44,778 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 878 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:44,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 639 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 11:44:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-10-13 11:44:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 943. [2024-10-13 11:44:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 433 states have (on average 2.2979214780600463) internal successors, (995), 938 states have internal predecessors, (995), 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-13 11:44:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1001 transitions. [2024-10-13 11:44:44,805 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1001 transitions. Word has length 3 [2024-10-13 11:44:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:44,806 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1001 transitions. [2024-10-13 11:44:44,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1001 transitions. [2024-10-13 11:44:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:44:44,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:44,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:44:44,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:44:45,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:45,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1668426, now seen corresponding path program 1 times [2024-10-13 11:44:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653323319] [2024-10-13 11:44:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:45,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:45,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:45,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:45,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:44:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:45,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:44:45,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:45,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:44:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:45,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:45,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653323319] [2024-10-13 11:44:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653323319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:44:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021105703] [2024-10-13 11:44:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:45,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:45,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:45,171 INFO L87 Difference]: Start difference. First operand 943 states and 1001 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:47,275 INFO L93 Difference]: Finished difference Result 1317 states and 1407 transitions. [2024-10-13 11:44:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 11:44:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:47,281 INFO L225 Difference]: With dead ends: 1317 [2024-10-13 11:44:47,281 INFO L226 Difference]: Without dead ends: 1317 [2024-10-13 11:44:47,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:47,285 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 406 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:47,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1215 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:44:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-10-13 11:44:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1048. [2024-10-13 11:44:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 539 states have (on average 2.2337662337662336) internal successors, (1204), 1043 states have internal predecessors, (1204), 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-13 11:44:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1210 transitions. [2024-10-13 11:44:47,308 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1210 transitions. Word has length 3 [2024-10-13 11:44:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:47,308 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1210 transitions. [2024-10-13 11:44:47,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1210 transitions. [2024-10-13 11:44:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:44:47,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:47,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:47,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 11:44:47,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:47,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:47,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1067389101, now seen corresponding path program 1 times [2024-10-13 11:44:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:47,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135188428] [2024-10-13 11:44:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:47,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:47,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:47,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:47,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:44:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:47,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:44:47,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:47,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:44:47,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:44:47,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:44:47,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:44:47,790 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:44:47,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:44:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:47,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:47,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135188428] [2024-10-13 11:44:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135188428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:47,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738973289] [2024-10-13 11:44:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:47,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:47,823 INFO L87 Difference]: Start difference. First operand 1048 states and 1210 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:49,882 INFO L93 Difference]: Finished difference Result 1201 states and 1371 transitions. [2024-10-13 11:44:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:44:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:49,887 INFO L225 Difference]: With dead ends: 1201 [2024-10-13 11:44:49,888 INFO L226 Difference]: Without dead ends: 1201 [2024-10-13 11:44:49,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:49,889 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1138 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:49,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 317 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 11:44:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-10-13 11:44:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 931. [2024-10-13 11:44:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 433 states have (on average 2.2678983833718247) internal successors, (982), 926 states have internal predecessors, (982), 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-13 11:44:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 988 transitions. [2024-10-13 11:44:49,917 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 988 transitions. Word has length 7 [2024-10-13 11:44:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:49,917 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 988 transitions. [2024-10-13 11:44:49,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 988 transitions. [2024-10-13 11:44:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:44:49,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:49,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:49,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 11:44:50,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:50,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:50,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1270676234, now seen corresponding path program 1 times [2024-10-13 11:44:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005182834] [2024-10-13 11:44:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:50,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:50,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:50,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:44:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:50,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:50,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:50,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:44:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:50,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:50,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005182834] [2024-10-13 11:44:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005182834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593124481] [2024-10-13 11:44:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:50,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:50,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:50,276 INFO L87 Difference]: Start difference. First operand 931 states and 988 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:51,533 INFO L93 Difference]: Finished difference Result 1076 states and 1154 transitions. [2024-10-13 11:44:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-13 11:44:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:51,536 INFO L225 Difference]: With dead ends: 1076 [2024-10-13 11:44:51,536 INFO L226 Difference]: Without dead ends: 1076 [2024-10-13 11:44:51,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:51,537 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 668 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:51,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 916 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:44:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-13 11:44:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 884. [2024-10-13 11:44:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 433 states have (on average 2.159353348729792) internal successors, (935), 879 states have internal predecessors, (935), 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-13 11:44:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 941 transitions. [2024-10-13 11:44:51,554 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 941 transitions. Word has length 8 [2024-10-13 11:44:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:51,554 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 941 transitions. [2024-10-13 11:44:51,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 941 transitions. [2024-10-13 11:44:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:44:51,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:51,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:51,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:44:51,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:51,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:51,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1270676235, now seen corresponding path program 1 times [2024-10-13 11:44:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:51,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780502504] [2024-10-13 11:44:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:51,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:51,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:51,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:51,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:44:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:51,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:44:51,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:51,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:44:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:51,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:51,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780502504] [2024-10-13 11:44:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780502504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699574209] [2024-10-13 11:44:51,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:51,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:51,915 INFO L87 Difference]: Start difference. First operand 884 states and 941 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:53,595 INFO L93 Difference]: Finished difference Result 1139 states and 1220 transitions. [2024-10-13 11:44:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-13 11:44:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:53,600 INFO L225 Difference]: With dead ends: 1139 [2024-10-13 11:44:53,600 INFO L226 Difference]: Without dead ends: 1139 [2024-10-13 11:44:53,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:53,601 INFO L432 NwaCegarLoop]: 854 mSDtfsCounter, 447 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:53,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1195 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:44:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-13 11:44:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 901. [2024-10-13 11:44:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 460 states have (on average 2.15) internal successors, (989), 896 states have internal predecessors, (989), 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-13 11:44:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 995 transitions. [2024-10-13 11:44:53,620 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 995 transitions. Word has length 8 [2024-10-13 11:44:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:53,621 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 995 transitions. [2024-10-13 11:44:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 995 transitions. [2024-10-13 11:44:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:44:53,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:53,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:53,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:44:53,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:53,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:53,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1957709799, now seen corresponding path program 1 times [2024-10-13 11:44:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924119718] [2024-10-13 11:44:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:53,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:53,832 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:53,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:44:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:53,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:53,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:54,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:54,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924119718] [2024-10-13 11:44:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924119718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:54,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:54,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727126144] [2024-10-13 11:44:54,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:54,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:54,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:54,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:54,036 INFO L87 Difference]: Start difference. First operand 901 states and 995 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:54,866 INFO L93 Difference]: Finished difference Result 1293 states and 1442 transitions. [2024-10-13 11:44:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:54,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 11:44:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:54,871 INFO L225 Difference]: With dead ends: 1293 [2024-10-13 11:44:54,871 INFO L226 Difference]: Without dead ends: 1293 [2024-10-13 11:44:54,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:54,872 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 418 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:54,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1608 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:44:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-10-13 11:44:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1044. [2024-10-13 11:44:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 603 states have (on average 2.074626865671642) internal successors, (1251), 1039 states have internal predecessors, (1251), 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-13 11:44:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1257 transitions. [2024-10-13 11:44:54,894 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1257 transitions. Word has length 11 [2024-10-13 11:44:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:54,894 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1257 transitions. [2024-10-13 11:44:54,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1257 transitions. [2024-10-13 11:44:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 11:44:54,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:54,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:54,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 11:44:55,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:55,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:55,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash -187666404, now seen corresponding path program 1 times [2024-10-13 11:44:55,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:55,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441317330] [2024-10-13 11:44:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:55,104 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:55,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:44:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:55,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:44:55,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:55,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:55,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441317330] [2024-10-13 11:44:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441317330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:44:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121514437] [2024-10-13 11:44:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:55,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:44:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:55,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:44:55,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:55,243 INFO L87 Difference]: Start difference. First operand 1044 states and 1257 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:55,982 INFO L93 Difference]: Finished difference Result 990 states and 1177 transitions. [2024-10-13 11:44:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:44:55,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 11:44:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:55,987 INFO L225 Difference]: With dead ends: 990 [2024-10-13 11:44:55,988 INFO L226 Difference]: Without dead ends: 990 [2024-10-13 11:44:55,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:44:55,989 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 61 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:55,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1502 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:44:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-13 11:44:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-13 11:44:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 573 states have (on average 2.043630017452007) internal successors, (1171), 985 states have internal predecessors, (1171), 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-13 11:44:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1177 transitions. [2024-10-13 11:44:56,020 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1177 transitions. Word has length 13 [2024-10-13 11:44:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:56,020 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1177 transitions. [2024-10-13 11:44:56,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1177 transitions. [2024-10-13 11:44:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 11:44:56,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:56,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:56,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 11:44:56,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:56,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:56,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash 778833688, now seen corresponding path program 1 times [2024-10-13 11:44:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988376863] [2024-10-13 11:44:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:56,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:56,225 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:56,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:44:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:56,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:44:56,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:56,469 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-13 11:44:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:56,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:56,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988376863] [2024-10-13 11:44:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988376863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:44:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331048413] [2024-10-13 11:44:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:56,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:56,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:56,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:44:56,473 INFO L87 Difference]: Start difference. First operand 990 states and 1177 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:57,752 INFO L93 Difference]: Finished difference Result 1238 states and 1445 transitions. [2024-10-13 11:44:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:44:57,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-10-13 11:44:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:57,755 INFO L225 Difference]: With dead ends: 1238 [2024-10-13 11:44:57,755 INFO L226 Difference]: Without dead ends: 1236 [2024-10-13 11:44:57,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-13 11:44:57,756 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 259 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1154 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:57,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1138 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 1154 Unchecked, 1.3s Time] [2024-10-13 11:44:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-13 11:44:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1049. [2024-10-13 11:44:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 632 states have (on average 2.0015822784810124) internal successors, (1265), 1044 states have internal predecessors, (1265), 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-13 11:44:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1271 transitions. [2024-10-13 11:44:57,773 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1271 transitions. Word has length 14 [2024-10-13 11:44:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:57,774 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1271 transitions. [2024-10-13 11:44:57,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1271 transitions. [2024-10-13 11:44:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 11:44:57,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:57,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:57,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:44:57,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:57,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:57,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash 778826778, now seen corresponding path program 1 times [2024-10-13 11:44:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056645005] [2024-10-13 11:44:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:57,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:57,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:57,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:57,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:44:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:58,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 11:44:58,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:58,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:58,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056645005] [2024-10-13 11:44:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056645005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:44:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822807404] [2024-10-13 11:44:58,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:44:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:44:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:44:58,169 INFO L87 Difference]: Start difference. First operand 1049 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:44:59,529 INFO L93 Difference]: Finished difference Result 1286 states and 1457 transitions. [2024-10-13 11:44:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:44:59,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-10-13 11:44:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:44:59,533 INFO L225 Difference]: With dead ends: 1286 [2024-10-13 11:44:59,533 INFO L226 Difference]: Without dead ends: 1282 [2024-10-13 11:44:59,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:44:59,534 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 392 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:44:59,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 3000 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 11:44:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-10-13 11:44:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1047. [2024-10-13 11:44:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 630 states have (on average 2.003174603174603) internal successors, (1262), 1042 states have internal predecessors, (1262), 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-13 11:44:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1268 transitions. [2024-10-13 11:44:59,555 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1268 transitions. Word has length 14 [2024-10-13 11:44:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:44:59,555 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1268 transitions. [2024-10-13 11:44:59,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:44:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1268 transitions. [2024-10-13 11:44:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:44:59,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:44:59,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:44:59,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 11:44:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:59,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:44:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:44:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 41237622, now seen corresponding path program 1 times [2024-10-13 11:44:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:44:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264510092] [2024-10-13 11:44:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:44:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:44:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:44:59,760 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:44:59,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:44:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:44:59,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:44:59,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:44:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:44:59,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:44:59,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:44:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264510092] [2024-10-13 11:44:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264510092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:44:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:44:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:44:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631332681] [2024-10-13 11:44:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:44:59,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:44:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:44:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:44:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:44:59,892 INFO L87 Difference]: Start difference. First operand 1047 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:00,454 INFO L93 Difference]: Finished difference Result 1030 states and 1202 transitions. [2024-10-13 11:45:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:45:00,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 11:45:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:00,458 INFO L225 Difference]: With dead ends: 1030 [2024-10-13 11:45:00,458 INFO L226 Difference]: Without dead ends: 1030 [2024-10-13 11:45:00,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:00,458 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 45 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:00,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2205 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:45:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-13 11:45:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2024-10-13 11:45:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 627 states have (on average 1.9074960127591707) internal successors, (1196), 1025 states have internal predecessors, (1196), 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-13 11:45:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1202 transitions. [2024-10-13 11:45:00,473 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1202 transitions. Word has length 15 [2024-10-13 11:45:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:00,474 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1202 transitions. [2024-10-13 11:45:00,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1202 transitions. [2024-10-13 11:45:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:45:00,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:00,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:00,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 11:45:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:00,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:00,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1080334143, now seen corresponding path program 1 times [2024-10-13 11:45:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098369758] [2024-10-13 11:45:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:00,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:00,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:00,681 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:00,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:45:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:00,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:45:00,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:00,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:00,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098369758] [2024-10-13 11:45:00,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098369758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:00,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:00,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:45:00,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553771279] [2024-10-13 11:45:00,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:00,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:45:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:00,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:45:00,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:45:00,875 INFO L87 Difference]: Start difference. First operand 1030 states and 1202 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:01,308 INFO L93 Difference]: Finished difference Result 976 states and 1122 transitions. [2024-10-13 11:45:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:45:01,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-13 11:45:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:01,312 INFO L225 Difference]: With dead ends: 976 [2024-10-13 11:45:01,312 INFO L226 Difference]: Without dead ends: 976 [2024-10-13 11:45:01,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:45:01,313 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 61 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:01,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1386 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:45:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-13 11:45:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-13 11:45:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 597 states have (on average 1.8693467336683418) internal successors, (1116), 971 states have internal predecessors, (1116), 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-13 11:45:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1122 transitions. [2024-10-13 11:45:01,327 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1122 transitions. Word has length 16 [2024-10-13 11:45:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1122 transitions. [2024-10-13 11:45:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1122 transitions. [2024-10-13 11:45:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 11:45:01,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:01,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:01,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:01,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1180971323, now seen corresponding path program 1 times [2024-10-13 11:45:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448708649] [2024-10-13 11:45:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:01,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:01,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:01,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:01,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:45:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:01,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:45:01,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:01,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:01,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448708649] [2024-10-13 11:45:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448708649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481020850] [2024-10-13 11:45:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:01,734 INFO L87 Difference]: Start difference. First operand 976 states and 1122 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:02,390 INFO L93 Difference]: Finished difference Result 960 states and 1078 transitions. [2024-10-13 11:45:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:45:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-10-13 11:45:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:02,401 INFO L225 Difference]: With dead ends: 960 [2024-10-13 11:45:02,402 INFO L226 Difference]: Without dead ends: 960 [2024-10-13 11:45:02,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:02,402 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 45 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:02,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2031 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:45:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-13 11:45:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-10-13 11:45:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 595 states have (on average 1.8016806722689076) internal successors, (1072), 955 states have internal predecessors, (1072), 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-13 11:45:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1078 transitions. [2024-10-13 11:45:02,418 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1078 transitions. Word has length 18 [2024-10-13 11:45:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:02,420 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1078 transitions. [2024-10-13 11:45:02,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1078 transitions. [2024-10-13 11:45:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:45:02,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:02,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:02,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:45:02,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:02,622 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1386590436, now seen corresponding path program 1 times [2024-10-13 11:45:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123902972] [2024-10-13 11:45:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:02,624 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:02,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:45:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:02,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:45:02,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:02,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:45:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:02,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:02,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123902972] [2024-10-13 11:45:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123902972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:45:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767326415] [2024-10-13 11:45:02,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:02,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:02,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:02,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:02,837 INFO L87 Difference]: Start difference. First operand 960 states and 1078 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:04,241 INFO L93 Difference]: Finished difference Result 1132 states and 1251 transitions. [2024-10-13 11:45:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-13 11:45:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:04,244 INFO L225 Difference]: With dead ends: 1132 [2024-10-13 11:45:04,244 INFO L226 Difference]: Without dead ends: 1132 [2024-10-13 11:45:04,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:04,245 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 701 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:04,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 926 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:45:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-13 11:45:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 956. [2024-10-13 11:45:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 595 states have (on average 1.781512605042017) internal successors, (1060), 951 states have internal predecessors, (1060), 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-13 11:45:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1066 transitions. [2024-10-13 11:45:04,257 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1066 transitions. Word has length 29 [2024-10-13 11:45:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:04,257 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1066 transitions. [2024-10-13 11:45:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1066 transitions. [2024-10-13 11:45:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:45:04,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:04,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:04,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:45:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:04,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:04,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1386590437, now seen corresponding path program 1 times [2024-10-13 11:45:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:04,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933958982] [2024-10-13 11:45:04,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:04,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:04,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:04,462 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:04,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:45:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:04,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:45:04,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:04,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:45:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:04,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:04,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933958982] [2024-10-13 11:45:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933958982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:45:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037196577] [2024-10-13 11:45:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:04,745 INFO L87 Difference]: Start difference. First operand 956 states and 1066 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:06,788 INFO L93 Difference]: Finished difference Result 963 states and 1068 transitions. [2024-10-13 11:45:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-13 11:45:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:06,791 INFO L225 Difference]: With dead ends: 963 [2024-10-13 11:45:06,791 INFO L226 Difference]: Without dead ends: 963 [2024-10-13 11:45:06,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:06,792 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 71 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:06,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1431 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 11:45:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-13 11:45:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 956. [2024-10-13 11:45:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 595 states have (on average 1.7747899159663865) internal successors, (1056), 951 states have internal predecessors, (1056), 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-13 11:45:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1062 transitions. [2024-10-13 11:45:06,803 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1062 transitions. Word has length 29 [2024-10-13 11:45:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:06,803 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1062 transitions. [2024-10-13 11:45:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1062 transitions. [2024-10-13 11:45:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:45:06,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:06,805 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] [2024-10-13 11:45:06,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 11:45:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:07,006 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:07,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:07,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1972786551, now seen corresponding path program 1 times [2024-10-13 11:45:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662500842] [2024-10-13 11:45:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:07,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:07,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:45:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:07,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:45:07,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:07,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:45:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:07,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:07,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:07,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662500842] [2024-10-13 11:45:07,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662500842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:07,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:07,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:45:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236311250] [2024-10-13 11:45:07,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:07,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:07,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:07,274 INFO L87 Difference]: Start difference. First operand 956 states and 1062 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:08,686 INFO L93 Difference]: Finished difference Result 963 states and 1064 transitions. [2024-10-13 11:45:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-13 11:45:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:08,689 INFO L225 Difference]: With dead ends: 963 [2024-10-13 11:45:08,689 INFO L226 Difference]: Without dead ends: 963 [2024-10-13 11:45:08,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:08,689 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 538 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:08,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1013 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:45:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-13 11:45:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2024-10-13 11:45:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 595 states have (on average 1.761344537815126) internal successors, (1048), 947 states have internal predecessors, (1048), 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-13 11:45:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1054 transitions. [2024-10-13 11:45:08,699 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1054 transitions. Word has length 32 [2024-10-13 11:45:08,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:08,700 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1054 transitions. [2024-10-13 11:45:08,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1054 transitions. [2024-10-13 11:45:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:45:08,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:08,701 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] [2024-10-13 11:45:08,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 11:45:08,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:08,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:08,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1972786550, now seen corresponding path program 1 times [2024-10-13 11:45:08,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274735583] [2024-10-13 11:45:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:08,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:08,910 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:08,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 11:45:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:09,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:45:09,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:09,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:45:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:09,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:09,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274735583] [2024-10-13 11:45:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274735583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:09,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:09,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:45:09,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106295561] [2024-10-13 11:45:09,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:09,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:09,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:09,235 INFO L87 Difference]: Start difference. First operand 952 states and 1054 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:11,087 INFO L93 Difference]: Finished difference Result 1191 states and 1278 transitions. [2024-10-13 11:45:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:11,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-13 11:45:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:11,093 INFO L225 Difference]: With dead ends: 1191 [2024-10-13 11:45:11,093 INFO L226 Difference]: Without dead ends: 1191 [2024-10-13 11:45:11,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:11,094 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 313 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:11,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1556 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 11:45:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-13 11:45:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 948. [2024-10-13 11:45:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 595 states have (on average 1.7478991596638656) internal successors, (1040), 943 states have internal predecessors, (1040), 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-13 11:45:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1046 transitions. [2024-10-13 11:45:11,107 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1046 transitions. Word has length 32 [2024-10-13 11:45:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:11,107 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1046 transitions. [2024-10-13 11:45:11,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1046 transitions. [2024-10-13 11:45:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 11:45:11,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:11,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:11,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 11:45:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:11,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2024880475, now seen corresponding path program 1 times [2024-10-13 11:45:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:11,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369346834] [2024-10-13 11:45:11,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:11,312 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:11,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 11:45:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:11,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:45:11,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:11,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:11,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369346834] [2024-10-13 11:45:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369346834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709737183] [2024-10-13 11:45:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:11,503 INFO L87 Difference]: Start difference. First operand 948 states and 1046 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:12,095 INFO L93 Difference]: Finished difference Result 930 states and 1016 transitions. [2024-10-13 11:45:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:45:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-13 11:45:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:12,100 INFO L225 Difference]: With dead ends: 930 [2024-10-13 11:45:12,100 INFO L226 Difference]: Without dead ends: 930 [2024-10-13 11:45:12,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:12,101 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 21 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:12,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1996 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:45:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-13 11:45:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2024-10-13 11:45:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 577 states have (on average 1.7504332755632583) internal successors, (1010), 925 states have internal predecessors, (1010), 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-13 11:45:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1016 transitions. [2024-10-13 11:45:12,113 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1016 transitions. Word has length 49 [2024-10-13 11:45:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:12,113 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1016 transitions. [2024-10-13 11:45:12,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1016 transitions. [2024-10-13 11:45:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:45:12,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:12,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:12,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:12,315 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -486844261, now seen corresponding path program 1 times [2024-10-13 11:45:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797389304] [2024-10-13 11:45:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:12,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:12,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:12,317 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:12,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:45:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:12,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:45:12,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:12,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:12,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:12,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797389304] [2024-10-13 11:45:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797389304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:12,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698005763] [2024-10-13 11:45:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:12,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:12,545 INFO L87 Difference]: Start difference. First operand 930 states and 1016 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:13,182 INFO L93 Difference]: Finished difference Result 918 states and 996 transitions. [2024-10-13 11:45:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:45:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-13 11:45:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:13,186 INFO L225 Difference]: With dead ends: 918 [2024-10-13 11:45:13,186 INFO L226 Difference]: Without dead ends: 918 [2024-10-13 11:45:13,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:13,186 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 15 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:13,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1990 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:45:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-10-13 11:45:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-10-13 11:45:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 565 states have (on average 1.752212389380531) internal successors, (990), 913 states have internal predecessors, (990), 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-13 11:45:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 996 transitions. [2024-10-13 11:45:13,194 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 996 transitions. Word has length 51 [2024-10-13 11:45:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 996 transitions. [2024-10-13 11:45:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 996 transitions. [2024-10-13 11:45:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 11:45:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:13,195 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] [2024-10-13 11:45:13,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 11:45:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:13,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -730644507, now seen corresponding path program 1 times [2024-10-13 11:45:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029143373] [2024-10-13 11:45:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:13,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:13,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:13,398 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:13,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 11:45:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:13,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:45:13,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:13,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:45:13,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:45:13,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:45:13,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 11:45:13,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:45:13,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 11:45:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:13,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:13,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029143373] [2024-10-13 11:45:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029143373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:45:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125046859] [2024-10-13 11:45:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:13,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:45:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:45:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:45:13,761 INFO L87 Difference]: Start difference. First operand 918 states and 996 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:14,926 INFO L93 Difference]: Finished difference Result 1346 states and 1445 transitions. [2024-10-13 11:45:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:45:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2024-10-13 11:45:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:14,930 INFO L225 Difference]: With dead ends: 1346 [2024-10-13 11:45:14,930 INFO L226 Difference]: Without dead ends: 1343 [2024-10-13 11:45:14,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:45:14,930 INFO L432 NwaCegarLoop]: 846 mSDtfsCounter, 1079 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:14,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 3372 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:45:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-10-13 11:45:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 869. [2024-10-13 11:45:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 516 states have (on average 1.819767441860465) internal successors, (939), 864 states have internal predecessors, (939), 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-13 11:45:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 945 transitions. [2024-10-13 11:45:14,943 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 945 transitions. Word has length 53 [2024-10-13 11:45:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:14,943 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 945 transitions. [2024-10-13 11:45:14,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 945 transitions. [2024-10-13 11:45:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 11:45:14,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:14,944 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] [2024-10-13 11:45:14,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:15,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:15,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1471935975, now seen corresponding path program 1 times [2024-10-13 11:45:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647442452] [2024-10-13 11:45:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:15,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:15,147 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:15,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 11:45:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:15,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:45:15,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:15,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:45:15,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:45:15,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:45:15,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:45:15,860 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:45:15,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:45:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:15,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:15,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647442452] [2024-10-13 11:45:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647442452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:15,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:45:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130789710] [2024-10-13 11:45:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:15,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:15,877 INFO L87 Difference]: Start difference. First operand 869 states and 945 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:17,161 INFO L93 Difference]: Finished difference Result 831 states and 907 transitions. [2024-10-13 11:45:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-13 11:45:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:17,164 INFO L225 Difference]: With dead ends: 831 [2024-10-13 11:45:17,164 INFO L226 Difference]: Without dead ends: 831 [2024-10-13 11:45:17,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:17,165 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 467 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:17,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 464 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 11:45:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-13 11:45:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 804. [2024-10-13 11:45:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 489 states have (on average 1.7116564417177915) internal successors, (837), 799 states have internal predecessors, (837), 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-13 11:45:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 843 transitions. [2024-10-13 11:45:17,176 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 843 transitions. Word has length 55 [2024-10-13 11:45:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:17,176 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 843 transitions. [2024-10-13 11:45:17,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 843 transitions. [2024-10-13 11:45:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:45:17,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:17,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:17,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:17,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:17,378 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:17,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1034628450, now seen corresponding path program 1 times [2024-10-13 11:45:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:17,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491933702] [2024-10-13 11:45:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:17,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:17,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:17,380 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:17,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 11:45:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:17,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:45:17,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:45:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:45:17,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:45:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:17,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:17,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491933702] [2024-10-13 11:45:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491933702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331885925] [2024-10-13 11:45:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:17,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:45:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:17,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:45:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:17,681 INFO L87 Difference]: Start difference. First operand 804 states and 843 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:19,153 INFO L93 Difference]: Finished difference Result 803 states and 842 transitions. [2024-10-13 11:45:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:45:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-13 11:45:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:19,156 INFO L225 Difference]: With dead ends: 803 [2024-10-13 11:45:19,156 INFO L226 Difference]: Without dead ends: 803 [2024-10-13 11:45:19,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:45:19,158 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 2 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:19,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1679 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:45:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-13 11:45:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-13 11:45:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 489 states have (on average 1.7096114519427403) internal successors, (836), 798 states have internal predecessors, (836), 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-13 11:45:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 842 transitions. [2024-10-13 11:45:19,167 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 842 transitions. Word has length 59 [2024-10-13 11:45:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:19,167 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 842 transitions. [2024-10-13 11:45:19,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 842 transitions. [2024-10-13 11:45:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:45:19,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:19,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:19,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:19,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:19,369 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:19,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1034628449, now seen corresponding path program 1 times [2024-10-13 11:45:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687217852] [2024-10-13 11:45:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:19,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:19,372 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:19,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 11:45:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:19,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:45:19,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:19,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:45:19,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:45:19,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:45:19,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:45:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:19,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:19,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687217852] [2024-10-13 11:45:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687217852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827522807] [2024-10-13 11:45:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:19,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:45:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:45:19,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:45:19,692 INFO L87 Difference]: Start difference. First operand 803 states and 842 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:21,421 INFO L93 Difference]: Finished difference Result 802 states and 841 transitions. [2024-10-13 11:45:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:45:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-13 11:45:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:21,425 INFO L225 Difference]: With dead ends: 802 [2024-10-13 11:45:21,425 INFO L226 Difference]: Without dead ends: 802 [2024-10-13 11:45:21,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:45:21,426 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:21,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1698 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:45:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-10-13 11:45:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2024-10-13 11:45:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 488 states have (on average 1.7110655737704918) internal successors, (835), 797 states have internal predecessors, (835), 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-13 11:45:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 841 transitions. [2024-10-13 11:45:21,435 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 841 transitions. Word has length 59 [2024-10-13 11:45:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:21,436 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 841 transitions. [2024-10-13 11:45:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:45:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 841 transitions. [2024-10-13 11:45:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 11:45:21,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:21,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:21,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:21,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:21,637 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:21,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash -396636830, now seen corresponding path program 1 times [2024-10-13 11:45:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:21,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983097364] [2024-10-13 11:45:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:21,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:21,639 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 11:45:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:21,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:45:21,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:21,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:45:21,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983097364] [2024-10-13 11:45:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983097364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:45:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:45:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:45:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612324682] [2024-10-13 11:45:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:45:21,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:45:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:21,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:45:21,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:21,903 INFO L87 Difference]: Start difference. First operand 802 states and 841 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:45:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:22,456 INFO L93 Difference]: Finished difference Result 804 states and 844 transitions. [2024-10-13 11:45:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:45:22,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-13 11:45:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:22,461 INFO L225 Difference]: With dead ends: 804 [2024-10-13 11:45:22,461 INFO L226 Difference]: Without dead ends: 804 [2024-10-13 11:45:22,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:45:22,462 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 0 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:22,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1926 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:45:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-13 11:45:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-10-13 11:45:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 489 states have (on average 1.7116564417177915) internal successors, (837), 799 states have internal predecessors, (837), 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-13 11:45:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 844 transitions. [2024-10-13 11:45:22,475 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 844 transitions. Word has length 65 [2024-10-13 11:45:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:22,475 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 844 transitions. [2024-10-13 11:45:22,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 11:45:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 844 transitions. [2024-10-13 11:45:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 11:45:22,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:22,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:22,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-13 11:45:22,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:22,677 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:22,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash -590398351, now seen corresponding path program 1 times [2024-10-13 11:45:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:22,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524283480] [2024-10-13 11:45:22,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:45:22,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:22,679 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:22,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 11:45:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:45:22,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:45:22,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:22,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:23,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524283480] [2024-10-13 11:45:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524283480] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:23,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:45:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715439575] [2024-10-13 11:45:23,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:23,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:45:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:45:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:45:23,009 INFO L87 Difference]: Start difference. First operand 804 states and 844 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:23,738 INFO L93 Difference]: Finished difference Result 813 states and 858 transitions. [2024-10-13 11:45:23,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:45:23,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2024-10-13 11:45:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:23,742 INFO L225 Difference]: With dead ends: 813 [2024-10-13 11:45:23,742 INFO L226 Difference]: Without dead ends: 813 [2024-10-13 11:45:23,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:45:23,743 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 5 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:23,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1924 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:45:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-13 11:45:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 812. [2024-10-13 11:45:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 496 states have (on average 1.7137096774193548) internal successors, (850), 806 states have internal predecessors, (850), 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-13 11:45:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 857 transitions. [2024-10-13 11:45:23,754 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 857 transitions. Word has length 66 [2024-10-13 11:45:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:23,755 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 857 transitions. [2024-10-13 11:45:23,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 857 transitions. [2024-10-13 11:45:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 11:45:23,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:23,756 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:23,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:23,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:23,956 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:23,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash 558274850, now seen corresponding path program 2 times [2024-10-13 11:45:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751712415] [2024-10-13 11:45:23,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:45:23,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-13 11:45:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:23,958 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:23,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 11:45:24,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:45:24,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:24,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:45:24,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:24,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:24,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751712415] [2024-10-13 11:45:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751712415] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:24,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:45:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724321223] [2024-10-13 11:45:24,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:24,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:45:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:24,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:45:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:45:24,457 INFO L87 Difference]: Start difference. First operand 812 states and 857 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:26,092 INFO L93 Difference]: Finished difference Result 824 states and 876 transitions. [2024-10-13 11:45:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:45:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2024-10-13 11:45:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:26,097 INFO L225 Difference]: With dead ends: 824 [2024-10-13 11:45:26,097 INFO L226 Difference]: Without dead ends: 822 [2024-10-13 11:45:26,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:45:26,100 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 8 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5126 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:26,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5126 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 11:45:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-13 11:45:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 821. [2024-10-13 11:45:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 505 states have (on average 1.706930693069307) internal successors, (862), 815 states have internal predecessors, (862), 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-13 11:45:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 869 transitions. [2024-10-13 11:45:26,115 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 869 transitions. Word has length 69 [2024-10-13 11:45:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:26,115 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 869 transitions. [2024-10-13 11:45:26,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 869 transitions. [2024-10-13 11:45:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 11:45:26,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:26,116 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:26,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:26,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:26,317 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:26,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:26,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1086093630, now seen corresponding path program 3 times [2024-10-13 11:45:26,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:26,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337525518] [2024-10-13 11:45:26,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:45:26,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:26,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:26,319 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:26,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-13 11:45:26,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:45:26,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:26,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:45:26,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:27,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:27,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337525518] [2024-10-13 11:45:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337525518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:27,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:27,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:45:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637668892] [2024-10-13 11:45:27,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:27,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:45:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:27,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:45:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:45:27,507 INFO L87 Difference]: Start difference. First operand 821 states and 869 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:30,905 INFO L93 Difference]: Finished difference Result 842 states and 905 transitions. [2024-10-13 11:45:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:45:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2024-10-13 11:45:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:30,908 INFO L225 Difference]: With dead ends: 842 [2024-10-13 11:45:30,908 INFO L226 Difference]: Without dead ends: 839 [2024-10-13 11:45:30,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 11:45:30,909 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 14 mSDsluCounter, 8328 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8970 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:30,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8970 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 11:45:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-13 11:45:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2024-10-13 11:45:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 523 states have (on average 1.6921606118546846) internal successors, (885), 833 states have internal predecessors, (885), 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-13 11:45:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 892 transitions. [2024-10-13 11:45:30,919 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 892 transitions. Word has length 75 [2024-10-13 11:45:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:30,919 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 892 transitions. [2024-10-13 11:45:30,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 892 transitions. [2024-10-13 11:45:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 11:45:30,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:30,920 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:30,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-10-13 11:45:31,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:31,121 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:31,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 132463106, now seen corresponding path program 4 times [2024-10-13 11:45:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:31,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681651017] [2024-10-13 11:45:31,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:45:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:31,125 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:31,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-13 11:45:31,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:45:31,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:31,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 11:45:31,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:31,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:45:33,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:33,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681651017] [2024-10-13 11:45:33,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681651017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:45:33,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:45:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:45:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496930808] [2024-10-13 11:45:33,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:45:33,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:45:33,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:45:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:45:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:45:33,225 INFO L87 Difference]: Start difference. First operand 839 states and 892 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:45:41,046 INFO L93 Difference]: Finished difference Result 876 states and 961 transitions. [2024-10-13 11:45:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:45:41,047 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2024-10-13 11:45:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:45:41,049 INFO L225 Difference]: With dead ends: 876 [2024-10-13 11:45:41,049 INFO L226 Difference]: Without dead ends: 874 [2024-10-13 11:45:41,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 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-13 11:45:41,052 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 25 mSDsluCounter, 14725 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 15367 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:45:41,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 15367 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-13 11:45:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-10-13 11:45:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 873. [2024-10-13 11:45:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 557 states have (on average 1.6714542190305206) internal successors, (931), 867 states have internal predecessors, (931), 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-13 11:45:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 938 transitions. [2024-10-13 11:45:41,071 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 938 transitions. Word has length 87 [2024-10-13 11:45:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:45:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 938 transitions. [2024-10-13 11:45:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 11:45:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 938 transitions. [2024-10-13 11:45:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 11:45:41,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:45:41,075 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:45:41,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-10-13 11:45:41,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:41,276 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-13 11:45:41,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:45:41,276 INFO L85 PathProgramCache]: Analyzing trace with hash 911568546, now seen corresponding path program 5 times [2024-10-13 11:45:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:45:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199093391] [2024-10-13 11:45:41,277 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:45:41,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:45:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:45:41,278 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:45:41,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-10-13 11:45:42,282 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:45:42,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:45:42,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 11:45:42,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:45:42,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:45:42,391 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 11:45:42,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 11:45:42,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:45:42,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-13 11:45:43,219 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:45:43,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-13 11:45:43,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-13 11:45:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 11:45:43,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:45:43,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:45:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199093391] [2024-10-13 11:45:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199093391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:45:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1111065833] [2024-10-13 11:45:43,601 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:45:43,601 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:45:43,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:45:43,602 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:45:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process