./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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/memsafety-broom/sll-nested-linux-list.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:28:06,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:28:06,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 16:28:06,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:28:06,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:28:06,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:28:06,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:28:06,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:28:06,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:28:06,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:28:06,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:28:06,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:28:06,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:28:06,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:28:06,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:28:06,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:28:06,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:28:06,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:28:06,166 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:28:06,166 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:28:06,166 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:28:06,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:28:06,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:28:06,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:28:06,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:28:06,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:28:06,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:28:06,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:28:06,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:28:06,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:28:06,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:28:06,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:28:06,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:28:06,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:28:06,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:28:06,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:28:06,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:28:06,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:28:06,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:28:06,173 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea [2024-10-24 16:28:06,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:28:06,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:28:06,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:28:06,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:28:06,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:28:06,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-24 16:28:07,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:28:07,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:28:07,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-24 16:28:07,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a348e748/d9d3983dad3147468e6c78ddb9fa9b3c/FLAGb30ad7871 [2024-10-24 16:28:08,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a348e748/d9d3983dad3147468e6c78ddb9fa9b3c [2024-10-24 16:28:08,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:28:08,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:28:08,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:28:08,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:28:08,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:28:08,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:08" (1/1) ... [2024-10-24 16:28:08,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407a29fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:08, skipping insertion in model container [2024-10-24 16:28:08,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:08" (1/1) ... [2024-10-24 16:28:08,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:28:08,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:28:08,548 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-24 16:28:08,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1737c85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:08, skipping insertion in model container [2024-10-24 16:28:08,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:28:08,549 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:28:08,551 INFO L158 Benchmark]: Toolchain (without parser) took 359.28ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 112.2MB in the end (delta: -32.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 16:28:08,551 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:28:08,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.36ms. Allocated memory is still 151.0MB. Free memory was 79.2MB in the beginning and 112.2MB in the end (delta: -33.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 16:28:08,552 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.20ms. Allocated memory is still 151.0MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.36ms. Allocated memory is still 151.0MB. Free memory was 79.2MB in the beginning and 112.2MB in the end (delta: -33.0MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2513]: 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/memsafety-broom/sll-nested-linux-list.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:28:10,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:28:10,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-10-24 16:28:10,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:28:10,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:28:10,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:28:10,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:28:10,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:28:10,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:28:10,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:28:10,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:28:10,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:28:10,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:28:10,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:28:10,155 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:28:10,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:28:10,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:28:10,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:28:10,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:28:10,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:28:10,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:28:10,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:28:10,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:28:10,157 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:28:10,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:28:10,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:28:10,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:28:10,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:28:10,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:28:10,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:28:10,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:28:10,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:28:10,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:28:10,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:28:10,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:28:10,160 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:28:10,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:28:10,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:28:10,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:28:10,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:28:10,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:28:10,162 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:28:10,162 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2bb1828824fef1ebc4678312eafda6c009efcfccb4cbbca24aec817e45186ea [2024-10-24 16:28:10,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:28:10,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:28:10,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:28:10,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:28:10,425 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:28:10,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-24 16:28:11,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:28:11,862 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:28:11,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-linux-list.i [2024-10-24 16:28:11,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7048190c1/314922544b15468f962cdca363d2e791/FLAG80b030642 [2024-10-24 16:28:12,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7048190c1/314922544b15468f962cdca363d2e791 [2024-10-24 16:28:12,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:28:12,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:28:12,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:28:12,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:28:12,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:28:12,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f558719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12, skipping insertion in model container [2024-10-24 16:28:12,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:28:12,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:28:12,560 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:28:12,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:28:12,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:28:12,614 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:28:12,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:28:12,681 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:28:12,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12 WrapperNode [2024-10-24 16:28:12,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:28:12,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:28:12,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:28:12,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:28:12,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,728 INFO L138 Inliner]: procedures = 129, calls = 45, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2024-10-24 16:28:12,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:28:12,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:28:12,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:28:12,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:28:12,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,761 INFO L175 MemorySlicer]: Split 25 memory accesses to 1 slices as follows [25]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 13 writes are split as follows [13]. [2024-10-24 16:28:12,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:28:12,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:28:12,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:28:12,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:28:12,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (1/1) ... [2024-10-24 16:28:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:28:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:12,803 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-24 16:28:12,805 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-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-10-24 16:28:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-10-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-24 16:28:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:28:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 16:28:12,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:28:12,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:28:12,934 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:28:12,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:28:13,506 INFO L? ?]: Removed 173 outVars from TransFormulas that were not future-live. [2024-10-24 16:28:13,507 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:28:13,543 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:28:13,544 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-24 16:28:13,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:28:13 BoogieIcfgContainer [2024-10-24 16:28:13,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:28:13,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:28:13,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:28:13,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:28:13,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:28:12" (1/3) ... [2024-10-24 16:28:13,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eec16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:28:13, skipping insertion in model container [2024-10-24 16:28:13,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:12" (2/3) ... [2024-10-24 16:28:13,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eec16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:28:13, skipping insertion in model container [2024-10-24 16:28:13,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:28:13" (3/3) ... [2024-10-24 16:28:13,549 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-linux-list.i [2024-10-24 16:28:13,561 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:28:13,561 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-10-24 16:28:13,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:28:13,604 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;@3abaa5a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:28:13,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2024-10-24 16:28:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 53 states have (on average 2.339622641509434) internal successors, (124), 111 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:28:13,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:13,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:28:13,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:13,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash 8225201, now seen corresponding path program 1 times [2024-10-24 16:28:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510815769] [2024-10-24 16:28:13,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:13,626 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-24 16:28:13,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:13,628 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-24 16:28:13,689 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-24 16:28:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:13,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:28:13,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:13,802 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-24 16:28:13,811 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-24 16:28:13,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:13,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:13,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510815769] [2024-10-24 16:28:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510815769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:13,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:13,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056432100] [2024-10-24 16:28:13,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:13,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:13,841 INFO L87 Difference]: Start difference. First operand has 117 states, 53 states have (on average 2.339622641509434) internal successors, (124), 111 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:28:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:14,108 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2024-10-24 16:28:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:14,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:28:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:14,116 INFO L225 Difference]: With dead ends: 114 [2024-10-24 16:28:14,116 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 16:28:14,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:14,119 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:14,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 16:28:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 16:28:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 107 states have internal predecessors, (112), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2024-10-24 16:28:14,145 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 4 [2024-10-24 16:28:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:14,146 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2024-10-24 16:28:14,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:28:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-10-24 16:28:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:28:14,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:14,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:28:14,152 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:14,348 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-24 16:28:14,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 8225202, now seen corresponding path program 1 times [2024-10-24 16:28:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046224248] [2024-10-24 16:28:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:14,350 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-24 16:28:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:14,353 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-24 16:28:14,353 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-24 16:28:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:14,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:28:14,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:14,417 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-24 16:28:14,428 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-24 16:28:14,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:14,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046224248] [2024-10-24 16:28:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046224248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:14,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389768913] [2024-10-24 16:28:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:14,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:14,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:14,431 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:28:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:14,708 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-24 16:28:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:28:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:14,709 INFO L225 Difference]: With dead ends: 110 [2024-10-24 16:28:14,709 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 16:28:14,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:14,710 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:14,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 156 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:28:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 16:28:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 16:28:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 53 states have (on average 2.056603773584906) internal successors, (109), 104 states have internal predecessors, (109), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2024-10-24 16:28:14,725 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 4 [2024-10-24 16:28:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:14,725 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2024-10-24 16:28:14,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:28:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-10-24 16:28:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:28:14,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:14,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:14,731 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-24 16:28:14,928 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-24 16:28:14,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:14,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash -651345792, now seen corresponding path program 1 times [2024-10-24 16:28:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:14,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720785067] [2024-10-24 16:28:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:14,930 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-24 16:28:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:14,931 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-24 16:28:14,932 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-24 16:28:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:15,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:28:15,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:15,010 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-24 16:28:15,014 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-24 16:28:15,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:15,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720785067] [2024-10-24 16:28:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720785067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:15,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889676410] [2024-10-24 16:28:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:15,017 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:15,194 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2024-10-24 16:28:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:15,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 16:28:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:15,196 INFO L225 Difference]: With dead ends: 109 [2024-10-24 16:28:15,196 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 16:28:15,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-24 16:28:15,197 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:15,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 16:28:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 16:28:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 103 states have internal predecessors, (108), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2024-10-24 16:28:15,202 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 15 [2024-10-24 16:28:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:15,203 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2024-10-24 16:28:15,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-10-24 16:28:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:28:15,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:15,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:15,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 16:28:15,404 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-24 16:28:15,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:15,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash -651345791, now seen corresponding path program 1 times [2024-10-24 16:28:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995442399] [2024-10-24 16:28:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:15,406 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-24 16:28:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:15,409 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-24 16:28:15,409 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-24 16:28:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:15,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:28:15,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:15,488 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-24 16:28:15,504 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-24 16:28:15,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:15,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995442399] [2024-10-24 16:28:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995442399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:15,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696992997] [2024-10-24 16:28:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:15,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:15,507 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:15,768 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-10-24 16:28:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:15,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 16:28:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:15,770 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:28:15,770 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:28:15,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-24 16:28:15,770 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:15,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:28:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:28:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 16:28:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 53 states have (on average 2.018867924528302) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2024-10-24 16:28:15,775 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 15 [2024-10-24 16:28:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:15,775 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2024-10-24 16:28:15,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-10-24 16:28:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:28:15,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:15,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:15,779 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-24 16:28:15,976 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-24 16:28:15,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:15,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1283118861, now seen corresponding path program 1 times [2024-10-24 16:28:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580955382] [2024-10-24 16:28:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:15,978 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-24 16:28:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:15,979 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-24 16:28:15,980 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-24 16:28:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:16,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:28:16,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:16,077 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-24 16:28:16,174 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:28:16,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 16:28:16,211 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-24 16:28:16,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:16,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:16,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580955382] [2024-10-24 16:28:16,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580955382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:16,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:16,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:16,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868855608] [2024-10-24 16:28:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:16,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:16,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:16,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:16,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:16,213 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:16,934 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-10-24 16:28:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:16,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-24 16:28:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:16,937 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:28:16,937 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:28:16,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:28:16,938 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:16,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 411 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:28:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:28:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2024-10-24 16:28:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 63 states have (on average 2.0) internal successors, (126), 111 states have internal predecessors, (126), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2024-10-24 16:28:16,947 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 16 [2024-10-24 16:28:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:16,948 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2024-10-24 16:28:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2024-10-24 16:28:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:28:16,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:16,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:16,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 16:28:17,148 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-24 16:28:17,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:17,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1283118862, now seen corresponding path program 1 times [2024-10-24 16:28:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:17,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306347450] [2024-10-24 16:28:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:17,150 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-24 16:28:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:17,153 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-24 16:28:17,154 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-24 16:28:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:17,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 16:28:17,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:17,274 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-24 16:28:17,280 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-24 16:28:17,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:17,483 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-24 16:28:17,492 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:28:17,493 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-24 16:28:17,535 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-24 16:28:17,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:17,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306347450] [2024-10-24 16:28:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306347450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:28:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32488522] [2024-10-24 16:28:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:17,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:28:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:17,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:28:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:28:17,538 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:18,550 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2024-10-24 16:28:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-24 16:28:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:18,552 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:28:18,552 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:28:18,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:28:18,553 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:18,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 357 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 16:28:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:28:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2024-10-24 16:28:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 111 states have internal predecessors, (125), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-10-24 16:28:18,557 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 16 [2024-10-24 16:28:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:18,557 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-10-24 16:28:18,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-10-24 16:28:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:28:18,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:18,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:18,564 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-24 16:28:18,762 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-24 16:28:18,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:18,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1121980778, now seen corresponding path program 1 times [2024-10-24 16:28:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064703996] [2024-10-24 16:28:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:18,764 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-24 16:28:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:18,766 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-24 16:28:18,767 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-24 16:28:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:18,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:28:18,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:18,852 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-24 16:28:18,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:18,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064703996] [2024-10-24 16:28:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064703996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:18,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742987308] [2024-10-24 16:28:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:18,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:18,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:18,853 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:19,002 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2024-10-24 16:28:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-24 16:28:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:19,003 INFO L225 Difference]: With dead ends: 117 [2024-10-24 16:28:19,003 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 16:28:19,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:19,004 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:19,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 16:28:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-24 16:28:19,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 110 states have internal predecessors, (123), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-10-24 16:28:19,013 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 17 [2024-10-24 16:28:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:19,013 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-10-24 16:28:19,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-10-24 16:28:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:28:19,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:19,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:19,022 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:19,214 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-24 16:28:19,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1121980779, now seen corresponding path program 1 times [2024-10-24 16:28:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624143858] [2024-10-24 16:28:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:19,216 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-24 16:28:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:19,218 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-24 16:28:19,219 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-24 16:28:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:19,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:28:19,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:19,384 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-24 16:28:19,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:19,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624143858] [2024-10-24 16:28:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624143858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:28:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108365266] [2024-10-24 16:28:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:28:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:19,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:28:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:28:19,386 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:19,916 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2024-10-24 16:28:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:28:19,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-24 16:28:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:19,917 INFO L225 Difference]: With dead ends: 134 [2024-10-24 16:28:19,917 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 16:28:19,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:28:19,918 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 42 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:19,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 697 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:28:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 16:28:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2024-10-24 16:28:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 63 states have (on average 1.9365079365079365) internal successors, (122), 110 states have internal predecessors, (122), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2024-10-24 16:28:19,923 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 17 [2024-10-24 16:28:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:19,923 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2024-10-24 16:28:19,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2024-10-24 16:28:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:28:19,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:19,923 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-24 16:28:19,928 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-24 16:28:20,124 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-24 16:28:20,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_internalErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:20,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash 421665923, now seen corresponding path program 1 times [2024-10-24 16:28:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043834332] [2024-10-24 16:28:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:20,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:28:20,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:20,128 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-24 16:28:20,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 16:28:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:28:20,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:20,223 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-24 16:28:20,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-24 16:28:20,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:20,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043834332] [2024-10-24 16:28:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043834332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:28:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444388373] [2024-10-24 16:28:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:28:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:28:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:28:20,241 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:20,485 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-24 16:28:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:28:20,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 16:28:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:20,487 INFO L225 Difference]: With dead ends: 115 [2024-10-24 16:28:20,487 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:28:20,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:28:20,488 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:20,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 249 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:28:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 16:28:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 108 states have internal predecessors, (118), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-10-24 16:28:20,491 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 18 [2024-10-24 16:28:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:20,491 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-10-24 16:28:20,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-10-24 16:28:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:28:20,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:20,492 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-24 16:28:20,497 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:20,692 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-24 16:28:20,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_internalErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 421665924, now seen corresponding path program 1 times [2024-10-24 16:28:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803056141] [2024-10-24 16:28:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:20,693 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-24 16:28:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:20,694 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-24 16:28:20,695 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-24 16:28:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:28:20,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:20,797 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-24 16:28:20,843 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-24 16:28:20,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:20,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803056141] [2024-10-24 16:28:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803056141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:20,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:28:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032981297] [2024-10-24 16:28:20,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:28:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:20,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:28:20,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:28:20,847 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:21,196 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-10-24 16:28:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:28:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 16:28:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:21,198 INFO L225 Difference]: With dead ends: 113 [2024-10-24 16:28:21,198 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 16:28:21,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:28:21,199 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:21,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 255 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:28:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 16:28:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 16:28:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 106 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2024-10-24 16:28:21,202 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 18 [2024-10-24 16:28:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:21,203 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-10-24 16:28:21,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2024-10-24 16:28:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:28:21,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:21,203 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] [2024-10-24 16:28:21,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:21,404 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-24 16:28:21,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_internalErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:21,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1494031814, now seen corresponding path program 1 times [2024-10-24 16:28:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628026277] [2024-10-24 16:28:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:21,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-24 16:28:21,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:21,407 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-24 16:28:21,408 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-24 16:28:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 16:28:21,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:21,588 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-24 16:28:21,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:21,780 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:28:21,780 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-24 16:28:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:21,842 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 15 treesize of output 7 [2024-10-24 16:28:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:21,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:21,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628026277] [2024-10-24 16:28:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628026277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:21,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:28:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548530489] [2024-10-24 16:28:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:28:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:28:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:28:21,864 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:22,823 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-10-24 16:28:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:28:22,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:28:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:22,825 INFO L225 Difference]: With dead ends: 127 [2024-10-24 16:28:22,825 INFO L226 Difference]: Without dead ends: 127 [2024-10-24 16:28:22,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:28:22,825 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:22,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 595 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 16:28:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-24 16:28:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-10-24 16:28:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 114 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-10-24 16:28:22,828 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 20 [2024-10-24 16:28:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-10-24 16:28:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-10-24 16:28:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:28:22,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:22,829 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] [2024-10-24 16:28:22,837 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 (12)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:23,032 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-24 16:28:23,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_internalErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:23,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1494031815, now seen corresponding path program 1 times [2024-10-24 16:28:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767723] [2024-10-24 16:28:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:28:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:23,034 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-24 16:28:23,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 16:28:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:23,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 16:28:23,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:23,206 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-24 16:28:23,210 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-24 16:28:23,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:23,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:23,476 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:28:23,477 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-24 16:28:23,485 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-24 16:28:23,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:23,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:23,573 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 15 treesize of output 7 [2024-10-24 16:28:23,577 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 7 treesize of output 3 [2024-10-24 16:28:23,604 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-24 16:28:23,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:23,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767723] [2024-10-24 16:28:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:28:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940719123] [2024-10-24 16:28:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:23,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:28:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:28:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:28:23,606 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:24,683 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2024-10-24 16:28:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:28:24,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:28:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:24,684 INFO L225 Difference]: With dead ends: 127 [2024-10-24 16:28:24,684 INFO L226 Difference]: Without dead ends: 127 [2024-10-24 16:28:24,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:28:24,684 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:24,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 409 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 16:28:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-24 16:28:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-10-24 16:28:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.732394366197183) internal successors, (123), 114 states have internal predecessors, (123), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:28:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-10-24 16:28:24,687 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 20 [2024-10-24 16:28:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:24,687 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-10-24 16:28:24,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-10-24 16:28:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:28:24,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:24,688 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] [2024-10-24 16:28:24,696 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-24 16:28:24,888 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-24 16:28:24,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:24,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1821893273, now seen corresponding path program 1 times [2024-10-24 16:28:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851742538] [2024-10-24 16:28:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:24,889 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-24 16:28:24,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:24,890 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-24 16:28:24,891 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-24 16:28:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:28:24,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:24,957 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-24 16:28:25,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-24 16:28:25,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:25,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851742538] [2024-10-24 16:28:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851742538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111981357] [2024-10-24 16:28:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:25,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:25,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:25,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:25,031 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:25,554 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2024-10-24 16:28:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:28:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-24 16:28:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:25,556 INFO L225 Difference]: With dead ends: 140 [2024-10-24 16:28:25,556 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 16:28:25,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:28:25,556 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:25,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 378 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:28:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 16:28:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2024-10-24 16:28:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.728395061728395) internal successors, (140), 124 states have internal predecessors, (140), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:28:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2024-10-24 16:28:25,559 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 21 [2024-10-24 16:28:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:25,559 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2024-10-24 16:28:25,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2024-10-24 16:28:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:28:25,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:25,560 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] [2024-10-24 16:28:25,564 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-24 16:28:25,760 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-24 16:28:25,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:25,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:25,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1821893272, now seen corresponding path program 1 times [2024-10-24 16:28:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165710765] [2024-10-24 16:28:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:25,761 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-24 16:28:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:25,764 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-24 16:28:25,764 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-24 16:28:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:25,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:28:25,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:25,838 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-24 16:28:25,946 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-24 16:28:25,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:25,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:25,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165710765] [2024-10-24 16:28:25,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165710765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:25,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373411150] [2024-10-24 16:28:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:25,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:25,947 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:26,578 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2024-10-24 16:28:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-24 16:28:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:26,580 INFO L225 Difference]: With dead ends: 139 [2024-10-24 16:28:26,580 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 16:28:26,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:28:26,580 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 14 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:26,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 408 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:28:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 16:28:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2024-10-24 16:28:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 124 states have internal predecessors, (138), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:28:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2024-10-24 16:28:26,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 21 [2024-10-24 16:28:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2024-10-24 16:28:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2024-10-24 16:28:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:28:26,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:26,584 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] [2024-10-24 16:28:26,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:26,784 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-24 16:28:26,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:26,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1507193128, now seen corresponding path program 1 times [2024-10-24 16:28:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:26,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381935398] [2024-10-24 16:28:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:26,786 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-24 16:28:26,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:26,788 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-24 16:28:26,788 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-24 16:28:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:26,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:28:26,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:26,885 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-24 16:28:26,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:26,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381935398] [2024-10-24 16:28:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381935398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:28:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088597618] [2024-10-24 16:28:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:28:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:28:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:28:26,886 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:27,103 INFO L93 Difference]: Finished difference Result 142 states and 159 transitions. [2024-10-24 16:28:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:28:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-24 16:28:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:27,104 INFO L225 Difference]: With dead ends: 142 [2024-10-24 16:28:27,104 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 16:28:27,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:28:27,104 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 20 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:27,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 494 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 16:28:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2024-10-24 16:28:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 125 states have internal predecessors, (138), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:28:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2024-10-24 16:28:27,108 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 23 [2024-10-24 16:28:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:27,108 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2024-10-24 16:28:27,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2024-10-24 16:28:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:28:27,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:27,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] [2024-10-24 16:28:27,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:27,309 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-24 16:28:27,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:27,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1507383536, now seen corresponding path program 1 times [2024-10-24 16:28:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072601874] [2024-10-24 16:28:27,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:27,317 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-24 16:28:27,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:27,318 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-24 16:28:27,319 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-24 16:28:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 16:28:27,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:27,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:27,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:27,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 16:28:27,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-24 16:28:27,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:28:27,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-10-24 16:28:27,651 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 7 treesize of output 3 [2024-10-24 16:28:27,675 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-24 16:28:27,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:27,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:27,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072601874] [2024-10-24 16:28:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072601874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:27,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 16:28:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792119602] [2024-10-24 16:28:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:27,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:28:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:28:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:28:27,676 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:28,303 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2024-10-24 16:28:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:28:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-24 16:28:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:28,305 INFO L225 Difference]: With dead ends: 138 [2024-10-24 16:28:28,305 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 16:28:28,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:28:28,305 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:28,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 652 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:28:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 16:28:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-10-24 16:28:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.654320987654321) internal successors, (134), 124 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:28:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-10-24 16:28:28,308 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 23 [2024-10-24 16:28:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:28,308 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-10-24 16:28:28,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-10-24 16:28:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:28:28,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:28,309 INFO L215 NwaCegarLoop]: trace histogram [2, 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-24 16:28:28,313 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-24 16:28:28,512 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-24 16:28:28,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1861564878, now seen corresponding path program 1 times [2024-10-24 16:28:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974692620] [2024-10-24 16:28:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:28,513 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-24 16:28:28,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:28,514 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-24 16:28:28,515 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-24 16:28:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:28,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:28:28,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:28,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:28,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:28,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:28:28,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-24 16:28:28,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:28:28,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 25 [2024-10-24 16:28:28,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-10-24 16:28:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:29,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:30,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974692620] [2024-10-24 16:28:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974692620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:28:30,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2024-10-24 16:28:30,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65012111] [2024-10-24 16:28:30,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:30,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:28:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:28:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:28:30,876 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:28:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:32,407 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2024-10-24 16:28:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:28:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-10-24 16:28:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:32,408 INFO L225 Difference]: With dead ends: 139 [2024-10-24 16:28:32,408 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 16:28:32,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:28:32,409 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:32,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 914 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 16:28:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 16:28:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2024-10-24 16:28:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.646341463414634) internal successors, (135), 125 states have internal predecessors, (135), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:28:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2024-10-24 16:28:32,412 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2024-10-24 16:28:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:32,412 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2024-10-24 16:28:32,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:28:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2024-10-24 16:28:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:28:32,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:32,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:32,418 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 (18)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:32,613 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-24 16:28:32,614 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash 466970200, now seen corresponding path program 1 times [2024-10-24 16:28:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431526231] [2024-10-24 16:28:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:32,614 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-24 16:28:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:32,615 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-24 16:28:32,616 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-24 16:28:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:32,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:28:32,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:32,716 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-24 16:28:32,762 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base (_ BitVec 64))) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (_ bv1 1)))) is different from true [2024-10-24 16:28:32,786 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:28:32,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 16:28:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-24 16:28:32,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:32,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:32,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431526231] [2024-10-24 16:28:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431526231] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:28:32,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:32,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-10-24 16:28:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719643690] [2024-10-24 16:28:32,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-10-24 16:28:32,953 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:28:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:33,535 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-10-24 16:28:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:28:33,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-10-24 16:28:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:33,536 INFO L225 Difference]: With dead ends: 141 [2024-10-24 16:28:33,536 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 16:28:33,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-10-24 16:28:33,537 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:33,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 327 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 0 Unknown, 116 Unchecked, 0.5s Time] [2024-10-24 16:28:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 16:28:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2024-10-24 16:28:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 126 states have internal predecessors, (139), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:28:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-10-24 16:28:33,539 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 27 [2024-10-24 16:28:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-10-24 16:28:33,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:28:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-10-24 16:28:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:28:33,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:33,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:33,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-24 16:28:33,740 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-24 16:28:33,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 466970201, now seen corresponding path program 1 times [2024-10-24 16:28:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761550175] [2024-10-24 16:28:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:33,741 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-24 16:28:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:33,743 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-24 16:28:33,744 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-24 16:28:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:33,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 16:28:33,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:33,846 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-24 16:28:33,855 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-24 16:28:34,004 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base (_ BitVec 64))) (and (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| alloc_and_zero_~pi~0.base)))) is different from true [2024-10-24 16:28:34,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:34,046 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-24 16:28:34,064 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:28:34,065 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-24 16:28:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-24 16:28:34,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:34,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:34,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761550175] [2024-10-24 16:28:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761550175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1412061008] [2024-10-24 16:28:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:34,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:28:34,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:28:34,282 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:28:34,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-10-24 16:28:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:34,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 16:28:34,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:34,444 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-24 16:28:34,449 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-24 16:28:34,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:34,578 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-24 16:28:34,586 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:28:34,586 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-24 16:28:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-24 16:28:34,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:38,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1412061008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:38,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:38,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-24 16:28:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88798468] [2024-10-24 16:28:38,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:38,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-24 16:28:38,738 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:28:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:39,667 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-10-24 16:28:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:28:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-24 16:28:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:39,668 INFO L225 Difference]: With dead ends: 146 [2024-10-24 16:28:39,668 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 16:28:39,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-10-24 16:28:39,668 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:39,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 276 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 490 Invalid, 0 Unknown, 121 Unchecked, 0.8s Time] [2024-10-24 16:28:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 16:28:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-24 16:28:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 134 states have internal predecessors, (147), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-24 16:28:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-10-24 16:28:39,671 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 27 [2024-10-24 16:28:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:39,671 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-10-24 16:28:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:28:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-10-24 16:28:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:28:39,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:39,672 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] [2024-10-24 16:28:39,677 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 (20)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:39,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:40,072 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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 16:28:40,073 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:40,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2037486387, now seen corresponding path program 1 times [2024-10-24 16:28:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757731023] [2024-10-24 16:28:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:40,074 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-24 16:28:40,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:40,076 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-24 16:28:40,077 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-24 16:28:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:28:40,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:40,160 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-24 16:28:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:40,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:40,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757731023] [2024-10-24 16:28:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757731023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51400649] [2024-10-24 16:28:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:40,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:40,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:40,243 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:40,882 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2024-10-24 16:28:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:40,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-24 16:28:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:40,883 INFO L225 Difference]: With dead ends: 179 [2024-10-24 16:28:40,883 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 16:28:40,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:40,884 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:40,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 356 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:28:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 16:28:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2024-10-24 16:28:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.6) internal successors, (160), 142 states have internal predecessors, (160), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-24 16:28:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2024-10-24 16:28:40,887 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 28 [2024-10-24 16:28:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:40,888 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2024-10-24 16:28:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2024-10-24 16:28:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:28:40,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:40,888 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] [2024-10-24 16:28:40,893 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 (22)] Ended with exit code 0 [2024-10-24 16:28:41,088 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-24 16:28:41,089 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2037486388, now seen corresponding path program 1 times [2024-10-24 16:28:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530794602] [2024-10-24 16:28:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:41,089 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-24 16:28:41,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:41,090 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-24 16:28:41,092 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-24 16:28:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:41,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:28:41,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:41,186 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-24 16:28:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:41,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:41,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:28:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530794602] [2024-10-24 16:28:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530794602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:41,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787327717] [2024-10-24 16:28:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:41,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:28:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:41,328 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:42,164 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2024-10-24 16:28:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-24 16:28:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:42,165 INFO L225 Difference]: With dead ends: 193 [2024-10-24 16:28:42,165 INFO L226 Difference]: Without dead ends: 193 [2024-10-24 16:28:42,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:42,166 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:42,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 377 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:28:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-24 16:28:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2024-10-24 16:28:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 118 states have (on average 1.694915254237288) internal successors, (200), 160 states have internal predecessors, (200), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-24 16:28:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2024-10-24 16:28:42,169 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 28 [2024-10-24 16:28:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:42,169 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2024-10-24 16:28:42,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:28:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2024-10-24 16:28:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:28:42,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:42,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:42,175 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 (23)] Ended with exit code 0 [2024-10-24 16:28:42,370 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-24 16:28:42,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting create_internalErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2024-10-24 16:28:42,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 334798742, now seen corresponding path program 1 times [2024-10-24 16:28:42,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:28:42,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669453293] [2024-10-24 16:28:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:42,372 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-24 16:28:42,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:28:42,375 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-24 16:28:42,375 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-24 16:28:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:42,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-24 16:28:42,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:42,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:28:42,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:42,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:28:43,003 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 16:28:43,004 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-24 16:28:43,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:43,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:43,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 16:28:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-24 16:28:43,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:43,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:28:43,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-24 16:28:43,436 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-10-24 16:28:43,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-10-24 16:28:43,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-10-24 16:28:43,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-10-24 16:28:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:43,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:43,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_create_internal_~ptr~0#1.base| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64))))))) is different from false [2024-10-24 16:28:50,748 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array (_ BitVec 64) (_ BitVec 64))) (|v_create_internal_~ptr~0#1.base_21| (_ BitVec 64)) (v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_823 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_internal_~ptr~0#1.base_21|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_internal_~ptr~0#1.base_21| v_ArrVal_823) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~new#1.base| v_ArrVal_821))) (store .cse0 |c_create_internal___list_add_~prev#1.base| (store (select .cse0 |c_create_internal___list_add_~prev#1.base|) |c_create_internal___list_add_~prev#1.offset| |c_create_internal___list_add_~new#1.base|))) |v_create_internal_~ptr~0#1.base_21| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64)))))))) is different from false [2024-10-24 16:28:50,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array (_ BitVec 64) (_ BitVec 64))) (|v_create_internal_~ptr~0#1.base_21| (_ BitVec 64)) (v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_823 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_internal_~ptr~0#1.base_21|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_internal_~ptr~0#1.base_21| v_ArrVal_823) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~next#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_create_internal___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_create_internal___list_add_~next#1.offset|) |c_create_internal___list_add_~new#1.base|)) |c_create_internal___list_add_~new#1.base| v_ArrVal_821))) (store .cse0 |c_create_internal___list_add_~prev#1.base| (store (select .cse0 |c_create_internal___list_add_~prev#1.base|) |c_create_internal___list_add_~prev#1.offset| |c_create_internal___list_add_~new#1.base|))) |v_create_internal_~ptr~0#1.base_21| v_ArrVal_824) |c_create_internal_~head#1.base|) (bvadd |c_create_internal_~head#1.offset| (_ bv8 64)))))))) is different from false [2024-10-24 16:29:03,132 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:29:03,292 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-10-24 16:29:03,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3004 treesize of output 2383 [2024-10-24 16:29:03,411 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-10-24 16:29:03,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 659 treesize of output 647 [2024-10-24 16:29:03,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:29:03,448 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 223 [2024-10-24 16:29:03,465 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 326 treesize of output 302 [2024-10-24 16:29:03,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 214 treesize of output 178 [2024-10-24 16:29:03,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 54 [2024-10-24 16:29:03,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 160 treesize of output 148 [2024-10-24 16:29:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-24 16:29:03,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:29:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669453293] [2024-10-24 16:29:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669453293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:03,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:29:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2024-10-24 16:29:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823460675] [2024-10-24 16:29:03,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:03,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-24 16:29:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:29:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-24 16:29:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=703, Unknown=77, NotChecked=174, Total=1056 [2024-10-24 16:29:03,905 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand has 33 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)