./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:49:24,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:49:24,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:49:24,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:49:24,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:49:24,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:49:24,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:49:24,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:49:24,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:49:24,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:49:24,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:49:24,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:49:24,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:49:24,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:49:24,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:49:24,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:49:24,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:49:24,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:49:24,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:49:24,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:49:24,514 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:49:24,514 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:49:24,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:49:24,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:49:24,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:49:24,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:49:24,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:49:24,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:49:24,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:49:24,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:49:24,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:49:24,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:49:24,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:49:24,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:49:24,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:49:24,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:49:24,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:49:24,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:49:24,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:49:24,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:49:24,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:49:24,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:49:24,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c [2024-11-19 06:49:24,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:49:24,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:49:24,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:49:24,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:49:24,846 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:49:24,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2024-11-19 06:49:26,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:49:26,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:49:26,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2024-11-19 06:49:26,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9784f595a/eba310e4655d4bb2b558c289cc8cb81e/FLAGaccc52b19 [2024-11-19 06:49:26,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9784f595a/eba310e4655d4bb2b558c289cc8cb81e [2024-11-19 06:49:26,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:49:26,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:49:26,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:49:26,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:49:26,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:49:26,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:26" (1/1) ... [2024-11-19 06:49:26,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ce4118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:26, skipping insertion in model container [2024-11-19 06:49:26,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:26" (1/1) ... [2024-11-19 06:49:26,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:49:27,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:49:27,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:49:27,294 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:49:27,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1de40b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:27, skipping insertion in model container [2024-11-19 06:49:27,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:49:27,295 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:49:27,297 INFO L158 Benchmark]: Toolchain (without parser) took 577.43ms. Allocated memory is still 155.2MB. Free memory was 99.5MB in the beginning and 82.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:49:27,298 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:49:27,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.23ms. Allocated memory is still 155.2MB. Free memory was 98.9MB in the beginning and 82.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:49:27,301 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.27ms. Allocated memory is still 155.2MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.23ms. Allocated memory is still 155.2MB. Free memory was 98.9MB in the beginning and 82.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:49:29,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:49:29,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:49:29,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:49:29,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:49:29,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:49:29,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:49:29,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:49:29,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:49:29,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:49:29,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:49:29,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:49:29,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:49:29,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:49:29,642 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:49:29,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:49:29,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:49:29,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:49:29,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:49:29,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:49:29,645 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:49:29,648 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:49:29,648 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:49:29,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:49:29,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:49:29,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:49:29,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:49:29,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:49:29,650 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:49:29,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:49:29,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:49:29,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:49:29,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:49:29,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:49:29,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:49:29,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:49:29,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:49:29,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:49:29,656 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:49:29,656 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:49:29,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:49:29,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:49:29,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:49:29,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:49:29,658 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c [2024-11-19 06:49:30,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:49:30,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:49:30,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:49:30,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:49:30,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:49:30,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2024-11-19 06:49:31,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:49:31,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:49:31,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2024-11-19 06:49:31,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd922c3d/d378d0f609e2416fb0af54eec6b7585a/FLAG12d671c58 [2024-11-19 06:49:31,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd922c3d/d378d0f609e2416fb0af54eec6b7585a [2024-11-19 06:49:31,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:49:31,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:49:31,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:49:31,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:49:31,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:49:31,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:31" (1/1) ... [2024-11-19 06:49:31,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0eafd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:31, skipping insertion in model container [2024-11-19 06:49:31,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:31" (1/1) ... [2024-11-19 06:49:32,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:49:32,383 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:49:32,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:49:32,478 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:49:32,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:49:32,510 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:49:32,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:49:32,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:49:32,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:49:32,663 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:49:32,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32 WrapperNode [2024-11-19 06:49:32,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:49:32,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:49:32,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:49:32,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:49:32,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,737 INFO L138 Inliner]: procedures = 165, calls = 69, calls flagged for inlining = 23, calls inlined = 15, statements flattened = 102 [2024-11-19 06:49:32,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:49:32,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:49:32,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:49:32,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:49:32,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,786 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-19 06:49:32,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:49:32,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:49:32,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:49:32,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:49:32,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (1/1) ... [2024-11-19 06:49:32,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:49:32,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:49:32,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:49:32,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:49:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:49:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:49:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:49:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:49:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:49:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:49:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:49:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:49:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:49:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:49:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:49:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:49:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:49:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:49:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:49:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:49:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:49:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:49:32,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:49:33,083 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:49:33,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:49:33,555 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-19 06:49:33,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:49:33,574 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:49:33,575 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 06:49:33,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:33 BoogieIcfgContainer [2024-11-19 06:49:33,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:49:33,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:49:33,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:49:33,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:49:33,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:49:31" (1/3) ... [2024-11-19 06:49:33,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9310d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:33, skipping insertion in model container [2024-11-19 06:49:33,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:32" (2/3) ... [2024-11-19 06:49:33,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9310d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:49:33, skipping insertion in model container [2024-11-19 06:49:33,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:33" (3/3) ... [2024-11-19 06:49:33,586 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-2.i [2024-11-19 06:49:33,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:49:33,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-19 06:49:33,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:49:33,661 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;@34d54140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:49:33,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-19 06:49:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 69 states have internal predecessors, (76), 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-11-19 06:49:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:49:33,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:33,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:33,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:33,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash -773899693, now seen corresponding path program 1 times [2024-11-19 06:49:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880715697] [2024-11-19 06:49:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:33,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:33,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:33,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:33,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 (2)] Waiting until timeout for monitored process [2024-11-19 06:49:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:33,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:49:33,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:33,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:33,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:33,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880715697] [2024-11-19 06:49:33,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880715697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:33,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:49:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130082856] [2024-11-19 06:49:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:49:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:33,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:49:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:49:33,959 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 69 states have internal predecessors, (76), 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) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:34,259 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-19 06:49:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:49:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 06:49:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:34,268 INFO L225 Difference]: With dead ends: 91 [2024-11-19 06:49:34,268 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 06:49:34,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:49:34,273 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:34,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 255 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 06:49:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2024-11-19 06:49:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 71 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-19 06:49:34,358 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 10 [2024-11-19 06:49:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:34,359 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-19 06:49:34,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-19 06:49:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:49:34,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:34,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:34,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:49:34,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:34,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:34,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash -745270542, now seen corresponding path program 1 times [2024-11-19 06:49:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:34,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732337657] [2024-11-19 06:49:34,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:34,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:34,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:34,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:34,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:49:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:34,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:49:34,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:34,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:34,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732337657] [2024-11-19 06:49:34,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732337657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:34,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:34,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:49:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473510856] [2024-11-19 06:49:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:34,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:49:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:34,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:49:34,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:49:34,717 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:34,762 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-11-19 06:49:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:49:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 06:49:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:34,764 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:49:34,765 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:49:34,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11-19 06:49:34,766 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:34,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:49:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-19 06:49:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-11-19 06:49:34,782 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2024-11-19 06:49:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:34,783 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-11-19 06:49:34,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-19 06:49:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:49:34,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:34,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:34,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:49:34,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:34,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:34,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1778913350, now seen corresponding path program 1 times [2024-11-19 06:49:34,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:34,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770905602] [2024-11-19 06:49:34,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:34,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:34,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:34,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:34,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:49:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:35,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:49:35,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:35,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:49:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:35,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:35,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:35,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770905602] [2024-11-19 06:49:35,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770905602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:35,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:35,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:49:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838886952] [2024-11-19 06:49:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:35,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:49:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:35,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:49:35,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:49:35,160 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:35,430 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-19 06:49:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:49:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:49:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:35,432 INFO L225 Difference]: With dead ends: 73 [2024-11-19 06:49:35,432 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 06:49:35,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:49:35,434 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 19 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:35,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 313 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 06:49:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-19 06:49:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.530612244897959) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-19 06:49:35,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 11 [2024-11-19 06:49:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:35,441 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-19 06:49:35,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-19 06:49:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:49:35,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:35,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:35,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:49:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:35,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash -688287718, now seen corresponding path program 1 times [2024-11-19 06:49:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484348128] [2024-11-19 06:49:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:35,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:35,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:35,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:35,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:49:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:35,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:49:35,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:35,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:35,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:35,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484348128] [2024-11-19 06:49:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484348128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:35,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:49:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039783621] [2024-11-19 06:49:35,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:49:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:49:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:49:35,767 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:35,801 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-19 06:49:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:49:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:49:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:35,803 INFO L225 Difference]: With dead ends: 73 [2024-11-19 06:49:35,806 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 06:49:35,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-19 06:49:35,808 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:35,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 267 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 06:49:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-19 06:49:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.510204081632653) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-19 06:49:35,814 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 12 [2024-11-19 06:49:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:35,814 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-19 06:49:35,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-19 06:49:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:49:35,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:35,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:35,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:49:36,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:36,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:36,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1054522617, now seen corresponding path program 1 times [2024-11-19 06:49:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:36,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847039679] [2024-11-19 06:49:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:36,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:36,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:36,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:36,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:49:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:36,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:49:36,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:36,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:36,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:36,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847039679] [2024-11-19 06:49:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847039679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:36,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:36,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:49:36,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567980654] [2024-11-19 06:49:36,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:36,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:49:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:36,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:49:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:49:36,178 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:36,200 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-19 06:49:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:49:36,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:49:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:36,204 INFO L225 Difference]: With dead ends: 75 [2024-11-19 06:49:36,205 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 06:49:36,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:49:36,206 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:36,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 06:49:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 06:49:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:49:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2024-11-19 06:49:36,215 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 12 [2024-11-19 06:49:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:36,216 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-11-19 06:49:36,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2024-11-19 06:49:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:49:36,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:36,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:36,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:49:36,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:36,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -214568166, now seen corresponding path program 1 times [2024-11-19 06:49:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241130993] [2024-11-19 06:49:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:36,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:36,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:36,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:36,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:49:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:36,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:49:36,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:36,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:36,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241130993] [2024-11-19 06:49:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241130993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:49:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401739829] [2024-11-19 06:49:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:49:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:49:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:49:36,522 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:36,620 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-19 06:49:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:49:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-19 06:49:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:36,621 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:49:36,621 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 06:49:36,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:49:36,622 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:36,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 162 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:49:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 06:49:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-19 06:49:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 65 states have internal predecessors, (70), 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-11-19 06:49:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-19 06:49:36,634 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 14 [2024-11-19 06:49:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:36,635 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-19 06:49:36,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-19 06:49:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:49:36,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:36,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:36,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:49:36,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:36,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:36,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1670090882, now seen corresponding path program 1 times [2024-11-19 06:49:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:36,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560772235] [2024-11-19 06:49:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:36,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:36,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:49:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:36,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:49:36,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:36,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:36,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:36,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560772235] [2024-11-19 06:49:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560772235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:49:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35397770] [2024-11-19 06:49:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:36,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:49:36,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:49:36,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:49:36,964 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:36,983 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-19 06:49:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:49:36,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 06:49:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:36,989 INFO L225 Difference]: With dead ends: 70 [2024-11-19 06:49:36,989 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 06:49:36,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:49:36,990 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:36,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 06:49:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 06:49:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 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-11-19 06:49:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-11-19 06:49:37,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 16 [2024-11-19 06:49:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:37,001 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-11-19 06:49:37,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-11-19 06:49:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:49:37,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:37,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:37,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:49:37,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:37,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:37,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 173950641, now seen corresponding path program 1 times [2024-11-19 06:49:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:37,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319288102] [2024-11-19 06:49:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:37,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:37,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:37,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:37,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:49:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:37,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:49:37,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:37,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:37,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:37,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319288102] [2024-11-19 06:49:37,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319288102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:49:37,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:49:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124081117] [2024-11-19 06:49:37,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:49:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:49:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:49:37,364 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:37,428 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-19 06:49:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:49:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 06:49:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:37,430 INFO L225 Difference]: With dead ends: 73 [2024-11-19 06:49:37,430 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 06:49:37,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:37,431 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:37,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 345 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 06:49:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-19 06:49:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 69 states have internal predecessors, (74), 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-11-19 06:49:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-19 06:49:37,438 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 17 [2024-11-19 06:49:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:37,439 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-19 06:49:37,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-19 06:49:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:49:37,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:37,442 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:37,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 06:49:37,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:37,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:37,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash -576773054, now seen corresponding path program 2 times [2024-11-19 06:49:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:37,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633336005] [2024-11-19 06:49:37,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:49:37,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:37,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:37,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:49:37,715 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:49:37,715 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:49:37,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:49:37,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:37,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:49:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:49:37,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:37,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:37,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633336005] [2024-11-19 06:49:37,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633336005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:37,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:37,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:49:37,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165069845] [2024-11-19 06:49:37,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:37,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:49:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:37,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:49:37,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:49:37,928 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:38,225 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-19 06:49:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:49:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 06:49:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:38,228 INFO L225 Difference]: With dead ends: 73 [2024-11-19 06:49:38,228 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 06:49:38,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:49:38,229 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:38,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 391 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 06:49:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-19 06:49:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.46) internal successors, (73), 68 states have internal predecessors, (73), 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-11-19 06:49:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-19 06:49:38,238 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 20 [2024-11-19 06:49:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:38,238 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-19 06:49:38,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-19 06:49:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:49:38,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:38,239 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:38,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:49:38,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:38,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -576773055, now seen corresponding path program 1 times [2024-11-19 06:49:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126013603] [2024-11-19 06:49:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:38,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:38,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:38,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:49:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:38,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:49:38,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:38,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:38,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126013603] [2024-11-19 06:49:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126013603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:49:38,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:49:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888923449] [2024-11-19 06:49:38,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:38,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:49:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:38,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:49:38,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:49:38,755 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:38,930 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-19 06:49:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:49:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 06:49:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:38,932 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:49:38,932 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 06:49:38,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:49:38,933 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 14 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:38,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 682 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:49:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 06:49:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 06:49:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 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-11-19 06:49:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-19 06:49:38,937 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 20 [2024-11-19 06:49:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-19 06:49:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-19 06:49:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:49:38,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:38,939 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:38,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:39,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:39,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:39,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1041908255, now seen corresponding path program 2 times [2024-11-19 06:49:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831374876] [2024-11-19 06:49:39,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:49:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:39,142 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:49:39,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:49:39,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:49:39,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:49:39,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:39,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 06:49:39,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:39,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:39,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831374876] [2024-11-19 06:49:39,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831374876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:39,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:49:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140848492] [2024-11-19 06:49:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:39,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:49:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:39,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:49:39,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:49:39,344 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:39,592 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-19 06:49:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:49:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 06:49:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:39,594 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:49:39,594 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 06:49:39,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:49:39,596 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 11 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:39,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 06:49:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-11-19 06:49:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 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-11-19 06:49:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-19 06:49:39,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2024-11-19 06:49:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-19 06:49:39,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-19 06:49:39,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:49:39,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:39,605 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:39,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:49:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:39,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:39,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:39,806 INFO L85 PathProgramCache]: Analyzing trace with hash -547959902, now seen corresponding path program 1 times [2024-11-19 06:49:39,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600658667] [2024-11-19 06:49:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:39,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:39,808 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:39,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:49:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:39,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:49:39,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:40,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:40,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:40,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600658667] [2024-11-19 06:49:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600658667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:49:40,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:49:40,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:49:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456450221] [2024-11-19 06:49:40,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:49:40,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:49:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:49:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:49:40,480 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:40,844 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-19 06:49:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:49:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-19 06:49:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:40,846 INFO L225 Difference]: With dead ends: 83 [2024-11-19 06:49:40,848 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 06:49:40,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:49:40,849 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:40,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 938 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 06:49:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 06:49:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 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-11-19 06:49:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-19 06:49:40,855 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 28 [2024-11-19 06:49:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:40,855 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-19 06:49:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-19 06:49:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:49:40,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:40,856 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:40,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:49:41,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:41,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:41,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1363557054, now seen corresponding path program 2 times [2024-11-19 06:49:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099276274] [2024-11-19 06:49:41,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:49:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:41,060 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:41,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:49:41,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:49:41,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:49:41,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:49:41,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:41,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:41,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:41,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099276274] [2024-11-19 06:49:41,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099276274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:41,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:41,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:49:41,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415248641] [2024-11-19 06:49:41,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:41,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:49:41,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:41,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:49:41,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:49:41,233 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:41,258 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-19 06:49:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:49:41,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-19 06:49:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:41,259 INFO L225 Difference]: With dead ends: 83 [2024-11-19 06:49:41,259 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 06:49:41,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:49:41,260 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:41,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 313 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 06:49:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 06:49:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 79 states have internal predecessors, (83), 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-11-19 06:49:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-11-19 06:49:41,264 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 34 [2024-11-19 06:49:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:41,264 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-11-19 06:49:41,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-11-19 06:49:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:49:41,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:41,265 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:41,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:49:41,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:41,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1035426952, now seen corresponding path program 1 times [2024-11-19 06:49:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949147855] [2024-11-19 06:49:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:41,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:41,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:41,474 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:41,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:49:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:41,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:49:41,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:41,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:41,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:41,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949147855] [2024-11-19 06:49:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949147855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:41,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:49:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031101464] [2024-11-19 06:49:41,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:41,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:49:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:49:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:49:41,810 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-11-19 06:49:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:42,092 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-11-19 06:49:42,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:49:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 36 [2024-11-19 06:49:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:42,094 INFO L225 Difference]: With dead ends: 82 [2024-11-19 06:49:42,094 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 06:49:42,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:49:42,095 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:42,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 308 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 06:49:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-11-19 06:49:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 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-11-19 06:49:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-19 06:49:42,100 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 36 [2024-11-19 06:49:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:42,101 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-19 06:49:42,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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-11-19 06:49:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-19 06:49:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:49:42,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:42,102 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:42,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:49:42,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:42,303 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:42,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1035426953, now seen corresponding path program 1 times [2024-11-19 06:49:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:42,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655957046] [2024-11-19 06:49:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:42,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:42,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:42,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:42,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:49:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:42,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:49:42,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:42,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:49:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:42,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:42,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:42,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655957046] [2024-11-19 06:49:42,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655957046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:42,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:42,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:49:42,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737868792] [2024-11-19 06:49:42,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:42,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:49:42,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:42,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:49:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:42,750 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-11-19 06:49:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:42,995 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-19 06:49:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:49:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 36 [2024-11-19 06:49:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:42,997 INFO L225 Difference]: With dead ends: 80 [2024-11-19 06:49:42,997 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 06:49:42,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:49:42,998 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:42,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 402 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 06:49:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-19 06:49:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 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-11-19 06:49:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-19 06:49:43,004 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 36 [2024-11-19 06:49:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-19 06:49:43,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-11-19 06:49:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-19 06:49:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:49:43,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:43,008 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:43,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:49:43,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:43,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:43,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 984754414, now seen corresponding path program 1 times [2024-11-19 06:49:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793805697] [2024-11-19 06:49:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:43,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:43,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:43,211 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:49:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:43,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:49:43,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:43,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:43,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:43,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793805697] [2024-11-19 06:49:43,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793805697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:43,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:43,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:49:43,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242649089] [2024-11-19 06:49:43,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:43,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:49:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:49:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:49:43,461 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:43,517 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-19 06:49:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:49:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-19 06:49:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:43,519 INFO L225 Difference]: With dead ends: 79 [2024-11-19 06:49:43,519 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 06:49:43,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:49:43,520 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 9 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:43,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 341 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 06:49:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 06:49:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 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-11-19 06:49:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-19 06:49:43,523 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 36 [2024-11-19 06:49:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-19 06:49:43,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:49:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-19 06:49:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:49:43,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:43,526 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:43,533 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-11-19 06:49:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:43,727 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1107414731, now seen corresponding path program 1 times [2024-11-19 06:49:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131030629] [2024-11-19 06:49:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:43,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:43,729 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:43,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:49:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:43,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:49:43,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:43,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:49:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:44,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:44,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131030629] [2024-11-19 06:49:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131030629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:49:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280990563] [2024-11-19 06:49:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:49:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:49:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:44,251 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-11-19 06:49:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:44,513 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-19 06:49:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:49:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 44 [2024-11-19 06:49:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:44,514 INFO L225 Difference]: With dead ends: 77 [2024-11-19 06:49:44,514 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 06:49:44,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:44,515 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:44,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 322 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:49:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 06:49:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 06:49:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 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-11-19 06:49:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-19 06:49:44,520 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 44 [2024-11-19 06:49:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:44,520 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-19 06:49:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-11-19 06:49:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-19 06:49:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:49:44,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:44,525 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:44,533 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-11-19 06:49:44,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:44,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:44,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1107414730, now seen corresponding path program 1 times [2024-11-19 06:49:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993357408] [2024-11-19 06:49:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:44,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:44,728 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:44,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 06:49:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:44,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:49:44,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:44,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:45,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:45,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993357408] [2024-11-19 06:49:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993357408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:49:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173719380] [2024-11-19 06:49:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:45,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:49:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:49:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:49:45,144 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-11-19 06:49:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:45,348 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-11-19 06:49:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:49:45,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 44 [2024-11-19 06:49:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:45,349 INFO L225 Difference]: With dead ends: 81 [2024-11-19 06:49:45,349 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 06:49:45,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:49:45,350 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:45,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 229 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 06:49:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-19 06:49:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 70 states have internal predecessors, (74), 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-11-19 06:49:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-19 06:49:45,353 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 44 [2024-11-19 06:49:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:45,353 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-19 06:49:45,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-11-19 06:49:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-19 06:49:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:49:45,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:45,354 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:45,361 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-11-19 06:49:45,554 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-11-19 06:49:45,555 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash -924854164, now seen corresponding path program 1 times [2024-11-19 06:49:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:45,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629350579] [2024-11-19 06:49:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:45,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:45,557 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-11-19 06:49:45,559 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-11-19 06:49:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:45,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:49:45,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:45,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:45,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629350579] [2024-11-19 06:49:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629350579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:49:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075805761] [2024-11-19 06:49:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:45,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:49:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:45,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:49:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:49:45,864 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-11-19 06:49:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:45,899 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2024-11-19 06:49:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:49:45,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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 46 [2024-11-19 06:49:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:45,901 INFO L225 Difference]: With dead ends: 75 [2024-11-19 06:49:45,901 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 06:49:45,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-11-19 06:49:45,901 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:45,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:49:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 06:49:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 06:49:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 70 states have internal predecessors, (73), 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-11-19 06:49:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-11-19 06:49:45,904 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 46 [2024-11-19 06:49:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:45,904 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-19 06:49:45,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-11-19 06:49:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-11-19 06:49:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:49:45,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:45,905 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:45,910 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-11-19 06:49:46,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:46,106 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:46,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1013011726, now seen corresponding path program 1 times [2024-11-19 06:49:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528247022] [2024-11-19 06:49:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:46,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:46,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 06:49:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:46,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:49:46,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:46,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:49:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:46,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:46,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528247022] [2024-11-19 06:49:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528247022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:49:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793256486] [2024-11-19 06:49:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:46,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:49:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:49:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:46,512 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-11-19 06:49:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:46,701 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2024-11-19 06:49:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:49:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 50 [2024-11-19 06:49:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:46,702 INFO L225 Difference]: With dead ends: 79 [2024-11-19 06:49:46,702 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 06:49:46,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:49:46,702 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:46,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 233 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:49:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 06:49:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-19 06:49:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 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-11-19 06:49:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-19 06:49:46,705 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 50 [2024-11-19 06:49:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:46,706 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-19 06:49:46,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-11-19 06:49:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-11-19 06:49:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:49:46,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:46,707 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:46,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:46,908 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1013011727, now seen corresponding path program 1 times [2024-11-19 06:49:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722624634] [2024-11-19 06:49:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:46,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:46,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:46,911 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-11-19 06:49:46,912 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-11-19 06:49:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:47,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:49:47,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:47,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:49:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:47,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:47,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722624634] [2024-11-19 06:49:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722624634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:47,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:49:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354349165] [2024-11-19 06:49:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:47,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:49:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:49:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:49:47,485 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-11-19 06:49:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:47,765 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-11-19 06:49:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:49:47,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 50 [2024-11-19 06:49:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:47,766 INFO L225 Difference]: With dead ends: 72 [2024-11-19 06:49:47,766 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 06:49:47,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:49:47,767 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:47,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 315 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:49:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 06:49:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-19 06:49:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 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-11-19 06:49:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2024-11-19 06:49:47,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 50 [2024-11-19 06:49:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:47,770 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2024-11-19 06:49:47,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-11-19 06:49:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2024-11-19 06:49:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 06:49:47,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:47,771 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:47,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:47,971 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-11-19 06:49:47,972 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:47,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2102811998, now seen corresponding path program 1 times [2024-11-19 06:49:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:47,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219949667] [2024-11-19 06:49:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:47,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:47,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:47,974 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-11-19 06:49:47,975 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-11-19 06:49:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:48,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:49:48,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:48,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:48,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219949667] [2024-11-19 06:49:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219949667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:48,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:49:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349790890] [2024-11-19 06:49:48,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:48,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:49:48,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:49:48,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:49:48,633 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-11-19 06:49:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:48,755 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2024-11-19 06:49:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:49:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 53 [2024-11-19 06:49:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:48,757 INFO L225 Difference]: With dead ends: 71 [2024-11-19 06:49:48,757 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 06:49:48,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:49:48,758 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:48,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 278 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:49:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 06:49:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-19 06:49:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.096774193548387) internal successors, (68), 65 states have internal predecessors, (68), 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-11-19 06:49:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2024-11-19 06:49:48,762 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2024-11-19 06:49:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:48,762 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2024-11-19 06:49:48,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-11-19 06:49:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2024-11-19 06:49:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:49:48,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:48,763 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:48,772 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-11-19 06:49:48,964 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-11-19 06:49:48,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 96183348, now seen corresponding path program 1 times [2024-11-19 06:49:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033070953] [2024-11-19 06:49:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:48,966 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-11-19 06:49:48,967 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-11-19 06:49:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:49,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 06:49:49,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:49,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:49,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:49,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:49:49,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:49:49,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:49:49,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-19 06:49:49,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:49,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 45 [2024-11-19 06:49:49,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:49,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2024-11-19 06:49:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:49:50,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:49:50,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:50,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033070953] [2024-11-19 06:49:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033070953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:49:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:49:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 06:49:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460288252] [2024-11-19 06:49:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:49:50,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:49:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:49:50,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:49:50,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:49:50,097 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 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-11-19 06:49:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:49:50,649 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2024-11-19 06:49:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:49:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 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 54 [2024-11-19 06:49:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:49:50,650 INFO L225 Difference]: With dead ends: 70 [2024-11-19 06:49:50,650 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 06:49:50,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:49:50,651 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:49:50,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 472 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:49:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 06:49:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 06:49:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 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-11-19 06:49:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-19 06:49:50,653 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 54 [2024-11-19 06:49:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:49:50,653 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-19 06:49:50,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 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-11-19 06:49:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-19 06:49:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 06:49:50,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:49:50,654 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:49:50,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-19 06:49:50,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:50,855 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:49:50,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:49:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1520860338, now seen corresponding path program 1 times [2024-11-19 06:49:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:49:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645280070] [2024-11-19 06:49:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:50,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:49:50,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:49:50,857 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:49:50,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-19 06:49:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:51,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-19 06:49:51,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:51,341 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-11-19 06:49:51,387 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-11-19 06:49:51,435 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 26 treesize of output 28 [2024-11-19 06:49:51,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-19 06:49:51,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-19 06:49:51,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-11-19 06:49:51,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-11-19 06:49:51,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-11-19 06:49:52,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2024-11-19 06:49:52,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2024-11-19 06:49:52,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2024-11-19 06:49:52,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2024-11-19 06:49:52,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 128 [2024-11-19 06:49:52,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 138 [2024-11-19 06:49:53,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 148 [2024-11-19 06:49:53,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:53,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 117 treesize of output 158 [2024-11-19 06:49:54,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 144 [2024-11-19 06:49:54,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:54,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 107 treesize of output 107 [2024-11-19 06:49:55,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:55,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 91 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 107 treesize of output 101 [2024-11-19 06:49:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:49:55,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:49:57,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:49:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645280070] [2024-11-19 06:49:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645280070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:49:57,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2049882126] [2024-11-19 06:49:57,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:49:57,536 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:49:57,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:49:57,537 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:49:57,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-19 06:49:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:49:58,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-19 06:49:58,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:49:58,295 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-11-19 06:49:58,310 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-11-19 06:49:58,331 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 26 treesize of output 28 [2024-11-19 06:49:58,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-19 06:49:58,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-19 06:49:58,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-11-19 06:49:58,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-11-19 06:49:58,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-11-19 06:49:58,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2024-11-19 06:49:58,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2024-11-19 06:49:58,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2024-11-19 06:49:58,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2024-11-19 06:49:58,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 128 [2024-11-19 06:49:58,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 138 [2024-11-19 06:49:59,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 148 [2024-11-19 06:49:59,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:59,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 117 treesize of output 158 [2024-11-19 06:49:59,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 144 [2024-11-19 06:49:59,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:49:59,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 107 treesize of output 107 [2024-11-19 06:50:00,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:00,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 91 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 107 treesize of output 101 [2024-11-19 06:50:00,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:00,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 78 treesize of output 114 [2024-11-19 06:50:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:01,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:50:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2049882126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:50:03,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:50:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 43 [2024-11-19 06:50:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677357462] [2024-11-19 06:50:03,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:50:03,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 06:50:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 06:50:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3267, Unknown=17, NotChecked=0, Total=3540 [2024-11-19 06:50:03,541 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 42 states have internal predecessors, (62), 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-11-19 06:50:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:16,695 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2024-11-19 06:50:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-19 06:50:16,696 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 42 states have internal predecessors, (62), 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 56 [2024-11-19 06:50:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:16,696 INFO L225 Difference]: With dead ends: 69 [2024-11-19 06:50:16,696 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 06:50:16,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=295, Invalid=3848, Unknown=17, NotChecked=0, Total=4160 [2024-11-19 06:50:16,698 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:16,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 669 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-19 06:50:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 06:50:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-19 06:50:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.064516129032258) internal successors, (66), 64 states have internal predecessors, (66), 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-11-19 06:50:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-11-19 06:50:16,703 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 56 [2024-11-19 06:50:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:16,703 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-11-19 06:50:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 42 states have internal predecessors, (62), 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-11-19 06:50:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-11-19 06:50:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 06:50:16,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:16,704 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:16,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-19 06:50:16,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-19 06:50:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:17,106 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:50:17,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash -97969657, now seen corresponding path program 1 times [2024-11-19 06:50:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880780063] [2024-11-19 06:50:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:17,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:17,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:17,109 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:17,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-19 06:50:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:17,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-19 06:50:17,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:17,557 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-11-19 06:50:17,593 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-11-19 06:50:17,633 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-11-19 06:50:17,674 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-11-19 06:50:17,721 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-11-19 06:50:17,762 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-11-19 06:50:17,819 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-11-19 06:50:17,864 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-11-19 06:50:17,905 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-11-19 06:50:17,948 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-11-19 06:50:17,999 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-11-19 06:50:18,051 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-11-19 06:50:18,098 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-11-19 06:50:18,139 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-11-19 06:50:18,190 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-11-19 06:50:18,232 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-11-19 06:50:18,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-11-19 06:50:18,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-19 06:50:18,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:18,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2024-11-19 06:50:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:18,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:50:19,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880780063] [2024-11-19 06:50:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880780063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:50:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1958996298] [2024-11-19 06:50:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:19,657 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:50:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:50:19,659 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:50:19,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-19 06:50:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:20,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-19 06:50:20,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:20,238 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-11-19 06:50:20,252 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-11-19 06:50:20,276 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-11-19 06:50:20,299 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-11-19 06:50:20,315 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-11-19 06:50:20,332 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-11-19 06:50:20,352 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-11-19 06:50:20,369 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-11-19 06:50:20,399 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-11-19 06:50:20,434 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-11-19 06:50:20,452 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-11-19 06:50:20,462 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-11-19 06:50:20,476 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-11-19 06:50:20,499 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-11-19 06:50:20,517 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-11-19 06:50:20,523 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-11-19 06:50:20,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-11-19 06:50:20,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-19 06:50:20,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:20,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2024-11-19 06:50:20,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:20,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 26 [2024-11-19 06:50:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:20,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:50:22,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1958996298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:50:22,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:50:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 44 [2024-11-19 06:50:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788126427] [2024-11-19 06:50:22,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:50:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 06:50:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:22,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 06:50:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3063, Unknown=0, NotChecked=0, Total=3306 [2024-11-19 06:50:22,238 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 44 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 42 states have internal predecessors, (63), 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-11-19 06:50:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:24,553 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2024-11-19 06:50:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-19 06:50:24,554 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 42 states have internal predecessors, (63), 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 57 [2024-11-19 06:50:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:24,554 INFO L225 Difference]: With dead ends: 65 [2024-11-19 06:50:24,554 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 06:50:24,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=307, Invalid=3853, Unknown=0, NotChecked=0, Total=4160 [2024-11-19 06:50:24,556 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:24,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 415 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 06:50:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 06:50:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 06:50:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 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-11-19 06:50:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2024-11-19 06:50:24,559 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 57 [2024-11-19 06:50:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:24,559 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2024-11-19 06:50:24,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 42 states have internal predecessors, (63), 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-11-19 06:50:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2024-11-19 06:50:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 06:50:24,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:24,560 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:24,571 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 (27)] Ended with exit code 0 [2024-11-19 06:50:24,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:24,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 06:50:24,961 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-19 06:50:24,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 995203642, now seen corresponding path program 1 times [2024-11-19 06:50:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061741564] [2024-11-19 06:50:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:24,963 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:24,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-19 06:50:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:25,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:50:25,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:25,507 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 0 case distinctions, treesize of input 14 treesize of output 3 [2024-11-19 06:50:25,609 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base_15| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base_15| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_ldv_kobject_cleanup_~kobj#1.base_15|)))) is different from true [2024-11-19 06:50:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 06:50:25,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:25,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:25,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061741564] [2024-11-19 06:50:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061741564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:25,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:25,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:50:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620147451] [2024-11-19 06:50:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:25,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:50:25,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:25,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:50:25,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:50:25,644 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 12 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 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-11-19 06:50:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:25,955 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2024-11-19 06:50:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:50:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 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 63 [2024-11-19 06:50:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:25,956 INFO L225 Difference]: With dead ends: 63 [2024-11-19 06:50:25,956 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:50:25,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:50:25,956 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:25,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 190 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2024-11-19 06:50:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:50:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:50:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:50:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:50:25,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-11-19 06:50:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:25,957 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:50:25,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 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-11-19 06:50:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:50:25,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:50:25,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-19 06:50:25,961 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2024-11-19 06:50:25,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-19 06:50:25,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:26,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:26,168 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:26,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:50:26,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:50:26 BoogieIcfgContainer [2024-11-19 06:50:26,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:50:26,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:50:26,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:50:26,172 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:50:26,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:49:33" (3/4) ... [2024-11-19 06:50:26,174 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:50:26,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-19 06:50:26,177 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2024-11-19 06:50:26,183 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-11-19 06:50:26,183 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 06:50:26,184 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 06:50:26,184 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:50:26,271 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:50:26,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:50:26,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:50:26,272 INFO L158 Benchmark]: Toolchain (without parser) took 54309.53ms. Allocated memory was 58.7MB in the beginning and 264.2MB in the end (delta: 205.5MB). Free memory was 38.5MB in the beginning and 162.8MB in the end (delta: -124.3MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,273 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 46.1MB. Free memory was 26.8MB in the beginning and 26.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:50:26,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.12ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 38.3MB in the beginning and 47.5MB in the end (delta: -9.1MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.27ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,274 INFO L158 Benchmark]: Boogie Preprocessor took 75.48ms. Allocated memory is still 71.3MB. Free memory was 45.1MB in the beginning and 40.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,274 INFO L158 Benchmark]: RCFGBuilder took 756.88ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 34.3MB in the end (delta: 6.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,274 INFO L158 Benchmark]: TraceAbstraction took 52593.56ms. Allocated memory was 71.3MB in the beginning and 264.2MB in the end (delta: 192.9MB). Free memory was 33.5MB in the beginning and 169.1MB in the end (delta: -135.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,275 INFO L158 Benchmark]: Witness Printer took 99.85ms. Allocated memory is still 264.2MB. Free memory was 169.1MB in the beginning and 162.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 06:50:26,276 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46ms. Allocated memory is still 46.1MB. Free memory was 26.8MB in the beginning and 26.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.12ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 38.3MB in the beginning and 47.5MB in the end (delta: -9.1MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.27ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.48ms. Allocated memory is still 71.3MB. Free memory was 45.1MB in the beginning and 40.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 756.88ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 34.3MB in the end (delta: 6.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 52593.56ms. Allocated memory was 71.3MB in the beginning and 264.2MB in the end (delta: 192.9MB). Free memory was 33.5MB in the beginning and 169.1MB in the end (delta: -135.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Witness Printer took 99.85ms. Allocated memory is still 264.2MB. Free memory was 169.1MB in the beginning and 162.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 52.5s, OverallIterations: 26, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 18.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 9108 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 7682 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5688 IncrementalHoareTripleChecker+Invalid, 5761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 1426 mSDtfsCounter, 5688 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1120 GetRequests, 782 SyntacticMatches, 5 SemanticMatches, 333 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=12, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 31 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 968 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1002 ConstructedInterpolants, 34 QuantifiedInterpolants, 12176 SizeOfPredicates, 69 NumberOfNonLiveVariables, 6250 ConjunctsInSsa, 839 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 1697/2373 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:50:26,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE